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

Shinya Sugawara

dblp:204/3379 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-5149-3197ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 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
1 paper
Learning theory · 67% Generative modeling · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › variational autoencoder
hierarchical latent variable model
0.312017
Decomposed Normalized Maximum Likelihood Codelength Criterion for Selecting Hierarchical Latent Variable Models · KDD 2017
Machine learning › Learning theory › model selection
minimum description length
0.312017
Decomposed Normalized Maximum Likelihood Codelength Criterion for Selecting Hierarchical Latent Variable Models · KDD 2017
Machine learning › Learning theory
model selection
0.312017
Decomposed Normalized Maximum Likelihood Codelength Criterion for Selecting Hierarchical Latent Variable Models · KDD 2017

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

minimum description length · 0.3decomposed normalized maximum likelihood · 0.3
YearPublicationVenuePosition
2019 The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models
Kenji Yamanishi, Shinya Sugawara, Makoto Okada
Data Min. Knowl. Discov.3
2017 Decomposed Normalized Maximum Likelihood Codelength Criterion for Selecting Hierarchical Latent Variable Models
abstract
We propose a new model selection criterion based on the minimum description length principle in a name of the decomposed normalized maximum likelihood criterion. Our criterion can be applied to a large class of hierarchical latent variable models, such as the Naive Bayes models, stochastic block models and latent Dirichlet allocations, for which many conventional information criteria cannot be straightforwardly applied due to irregularity of latent variable models. Our method also has an advantage that it can be exactly evaluated without asymptotic approximation with small time complexity. Our experiments using synthetic and real data demonstrated validity of our method in terms of computational efficiency and model selection accuracy, while our criterion especially dominated the other criteria when sample size is small and when data are noisy.
Shinya Sugawara, Kenji Yamanishi
KDD2