Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Seiichi Inoue

dblp:88/1122 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Information extraction and text analysis · 87% Language models and text generation · 13% Knowledge representation and reasoning · 0%
Theoretical computer science
1 paper
Logic in computer science · 77% Algorithms and data structures · 23%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › topic model
dynamic topic models
0.612022
Infinite SCAN: An Infinite Model of Diachronic Semantic Change · EMNLP 2022
Natural language and speech › Information extraction and text analysis › lexical semantics
semantic change detection
0.612022
Infinite SCAN: An Infinite Model of Diachronic Semantic Change · EMNLP 2022
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge-based systems › rule-based systems
rule-based reasoning
0.011971
A Method of Pattern Recognition Using Rewriting Rules · IJCAI 1971
Logic in computer science
rewriting systems
0.011971
A Method of Pattern Recognition Using Rewriting Rules · IJCAI 1971
Algorithms and data structures › sequence algorithms › string algorithms
string matching
0.011971
A Method of Pattern Recognition Using Rewriting Rules · IJCAI 1971

Methods — techniques the papers use, named apart from their topics

logistic stick-breaking process · 0.6gaussian markov random field · 0.6dirichlet process · 0.6bayesian modeling · 0.6rewriting rules · 0.0
YearPublicationVenuePosition
2022 Infinite SCAN: An Infinite Model of Diachronic Semantic Change
abstract
In this study, we propose a Bayesian model that can jointly estimate the number of senses of words and their changes through time.The model combines a dynamic topic model on Gaussian Markov random fields (Frermann and Lapata, 2016) with a logistic stick-breaking process that realizes the Dirichlet process.In the experiments, we evaluated the proposed model in terms of interpretability, accuracy in estimating the number of senses, and tracking their changes using both artificial data and real data.We quantitatively verified that the model behaves as expected through evaluation using artificial data.Using the CCOHA corpus, we showed that our model outperforms the baseline model and investigated the semantic changes of several well-known target words.
Seiichi Inoue, Mamoru Komachi, Toshinobu Ogiso, Hiroya Takamura, Daichi Mochihashi
EMNLP1
1971 A Method of Pattern Recognition Using Rewriting Rules
Akira Kurematsu, Manabu Takeda, Seiichi Inoue
IJCAI3