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

Zhenyu Qian 0006

dblp:q/ZQian-6 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0003-4037-1976ORCID · conflict

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

Databases, data management, data science and information retrieval · 1 · 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.

Artificial intelligence
1 paper
Information extraction and text analysis · 100%
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
Natural language and speech › Information extraction and text analysis › topic model
short text topic modeling
0.612022
Short Text Topic Modeling Techniques, Applications, and Performance: A Survey · IEEE Trans. Knowl. Data Eng. 2022
Natural language and speech › Information extraction and text analysis
topic model
0.612022
Short Text Topic Modeling Techniques, Applications, and Performance: A Survey · IEEE Trans. Knowl. Data Eng. 2022
Data mining
clustering
0.212022
Short Text Topic Modeling Techniques, Applications, and Performance: A Survey · IEEE Trans. Knowl. Data Eng. 2022

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

word co-occurrence · 1.1self-aggregation · 1.1dirichlet multinomial mixture · 1.1
YearPublicationVenuePosition
2022 Short Text Topic Modeling Techniques, Applications, and Performance: A Survey
abstract
Analyzing short texts infers discriminative and coherent latent topics that is a critical and fundamental task since many real-world applications require semantic understanding of short texts. Traditional long text topic modeling algorithms (e.g., PLSA and LDA) based on word co-occurrences cannot solve this problem very well since only very limited word co-occurrence information is available in short texts. Therefore, short text topic modeling has already attracted much attention from the machine learning research community in recent years, which aims at overcoming the problem of sparseness in short texts. In this survey, we conduct a comprehensive review of various short text topic modeling techniques proposed in the literature. We present three categories of methods based on Dirichlet multinomial mixture, global word co-occurrences, and self-aggregation, with example of representative approaches in each category and analysis of their performance on various tasks. We develop the first comprehensive open-source library, called STTM, for use in Java that integrates all surveyed algorithms within a unified interface, benchmark datasets, to facilitate the expansion of new methods in this research field. Finally, we evaluate these state-of-the-art methods on many real-world datasets and compare their performance against one another and versus long text topic modeling algorithm.
Jipeng Qiang, Zhenyu Qian 0006, Yun Li 0010, Yun-Hao Yuan 0001, Xindong Wu 0001
IEEE Trans. Knowl. Data Eng.2