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

Yu Hayashi

dblp:124/7068 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2015
0000-0001-5007-4532ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 50% Efficient and distributed learning · 50%

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

TopicWeightPapersLastEvidence papers
Data mining › time series analysis
change point detection
0.112012
Sequential Network Change Detection with Its Applications to Ad Impact Relation Analysis · ICDM 2012
Data mining
time series analysis
0.112012
Sequential Network Change Detection with Its Applications to Ad Impact Relation Analysis · ICDM 2012
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network
0.012012
Sequential Network Change Detection with Its Applications to Ad Impact Relation Analysis · ICDM 2012
Machine learning › Efficient and distributed learning › adaptive computation
dynamic model selection
0.012012
Sequential Network Change Detection with Its Applications to Ad Impact Relation Analysis · ICDM 2012

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

hoeffding's bound · 0.3dynamic programming · 0.3bayesian network · 0.3
YearPublicationVenuePosition
2015 Sequential network change detection with its applications to ad impact relation analysis
Yu Hayashi, Kenji Yamanishi
Data Min. Knowl. Discov.1
2012 Sequential Network Change Detection with Its Applications to Ad Impact Relation Analysis
abstract
We are concerned with the issue of tracking changes of variable dependencies from multivariate time series. Conventionally, this issue has been addressed in the batch scenario where the whole data set is given at once, and the change detection must be done in a retrospective way. This paper addresses this issue in a sequential scenario where multivariate data are sequentially input and the detection must be done in a sequential fashion. We propose a new method for sequential tracking of variable dependencies. In it we employ a Bayesian network as a representation of variable dependencies. The key ideas of our method are, 1) we extend the theory of dynamic model selection (DMS), which has been developed in the batch-learning scenario, into the sequential setting, and apply it to our issue, 2) we conduct the change detection sequentially using dynamic programming per a window where we employ the Hoeffding's bound to automatically determine the window size. We empirically demonstrate that our proposed method is able to perform change detection more efficiently than a conventional batch method. Further, we give a new framework of an application of variable dependency change detection, which we call Ad Impact Relation analysis (AIR). In it, we detect the time point when a commercial message advertisement has given an impact on the market and effectively visulaize the impact through network changes. We employ real data sets to demonstrate the validity of AIR.
Yu Hayashi, Kenji Yamanishi
ICDM1