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

Liangxing Shi

dblp:131/9765 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0004-7451-4810ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › clustering › mixture modeling
dirichlet process mixture model
0.212013
Dirichlet Process Mixture Model for Document Clustering with Feature Partition · IEEE Trans. Knowl. Data Eng. 2013
Data mining › clustering
document clustering
0.212013
Dirichlet Process Mixture Model for Document Clustering with Feature Partition · IEEE Trans. Knowl. Data Eng. 2013
Data mining › clustering
feature clustering
0.212013
Dirichlet Process Mixture Model for Document Clustering with Feature Partition · IEEE Trans. Knowl. Data Eng. 2013

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

variational inference · 0.2dirichlet process mixture model · 0.2
YearPublicationVenuePosition
2026 Beyond Noise: A BERT-Enhanced framework for Intelligent product optimization via online review Analytics
Liangxing Shi, Yingdong He, Zhen He 0001
Expert Syst. Appl.1
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.5