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

Guan Yu

dblp:35/4299 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2013
0000-0002-7833-9755ORCID · reported

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

Databases, data management, data science and information retrieval · 2 · 1 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
2 papers
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › clustering › mixture modeling
dirichlet process mixture model
0.322013
Dirichlet Process Mixture Model for Document Clustering with Feature Partition · IEEE Trans. Knowl. Data Eng. 2013
Document clustering via dirichlet process mixture model with feature selection · KDD 2010
Data mining › clustering
document clustering
0.322013
Dirichlet Process Mixture Model for Document Clustering with Feature Partition · IEEE Trans. Knowl. Data Eng. 2013
Document clustering via dirichlet process mixture model with feature selection · KDD 2010
Data mining › clustering
feature clustering
0.212013
Dirichlet Process Mixture Model for Document Clustering with Feature Partition · IEEE Trans. Knowl. Data Eng. 2013
Data mining
clustering
0.112010
Document clustering via dirichlet process mixture model with feature selection · KDD 2010
Data mining › dimensionality reduction
feature selection
0.112010
Document clustering via dirichlet process mixture model with feature selection · KDD 2010

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

dirichlet process mixture model · 0.3variational inference · 0.2stochastic search variable selection · 0.1
YearPublicationVenuePosition
2013 Dirichlet Process Mixture Model for Document Clustering with Feature Partition
abstract
Finding the appropriate number of clusters to which documents should be partitioned is crucial in document clustering. In this paper, we propose a novel approach, namely DPMFP, to discover the latent cluster structure based on the DPM model without requiring the number of clusters as input. Document features are automatically partitioned into two groups, in particular, discriminative words and nondiscriminative words, and contribute differently to document clustering. A variational inference algorithm is investigated to infer the document collection structure as well as the partition of document words at the same time. Our experiments indicate that our proposed approach performs well on the synthetic data set as well as real data sets. The comparison between our approach and state-of-the-art document clustering approaches shows that our approach is robust and effective for document clustering.
Rui-zhang Huang, Guan Yu, Zhaojun Wang, Jun Zhang 0003, Liangxing Shi
IEEE Trans. Knowl. Data Eng.2
2010 Document clustering via dirichlet process mixture model with feature selection
abstract
One essential issue of document clustering is to estimate the appropriate number of clusters for a document collection to which documents should be partitioned. In this paper, we propose a novel approach, namely DPMFS, to address this issue. The proposed approach is designed 1) to group documents into a set of clusters while the number of document clusters is determined by the Dirichlet process mixture model automatically; 2) to identify the discriminative words and separate them from irrelevant noise words via stochastic search variable selection technique. We explore the performance of our proposed approach on both a synthetic dataset and several realistic document datasets. The comparison between our proposed approach and stage-of-the-art document clustering approaches indicates that our approach is robust and effective for document clustering.
Guan Yu, Rui-zhang Huang, Zhaojun Wang
KDD1