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.

Minkuan Lu

dblp:381/6145 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › probabilistic graphical models
dirichlet multinomial mixture
0.812024
A Multi-View Clustering Algorithm for Short Text · ICDE 2024
Data mining › clustering
document clustering
0.812024
A Multi-View Clustering Algorithm for Short Text · ICDE 2024
Data mining › clustering
multi-view clustering
0.812024
A Multi-View Clustering Algorithm for Short Text · ICDE 2024
Data mining › clustering › document clustering
short text clustering
0.812024
A Multi-View Clustering Algorithm for Short Text · ICDE 2024
Data mining › text mining
topic model
0.812024
A Multi-View Clustering Algorithm for Short Text · ICDE 2024

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

gaussian mixture model · 0.8document embedding · 0.8
YearPublicationVenuePosition
2024 A Multi-View Clustering Algorithm for Short Text
abstract
The objective of the short text clustering task is to group semantically similar short texts into one class and segregate semantically different short texts. Despite the commendable performance achieved by existing topic model based short text clustering algorithms and deep clustering models, a fundamental limitation persists. Both of them are based on one view of the text, which inevitably constrains their clustering performance. Specifically, the topic model based short text clustering algorithms represent short texts as bag-of-words, while the deep clustering models represent short texts as document embeddings. To address these issues, we propose a Multi-View Clustering (MVC) model that considers both views of the text. We modeled the bag-of-words view using the Dirichlet Multinomial Mixture (DMM) model and the document embedding view using the Gaussian Mixture Model (GMM). A Bernoulli random variable is used to control these two models, enabling our proposed model to utilize the semantic information of short text embeddings while obtaining the bag-of-words information. Extensive experiments on four datasets demonstrate MVC's effectiveness. The code for MVC is available at https://github.com/jhyin12/MVC.
Minkuan Lu, Jianhua Yin 0001, Kaijun Wang, Liqiang Nie
ICDE1