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

Fei Wang 0148

dblp:52/3194-148 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 2

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 · 95% Information retrieval · 5%

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

TopicWeightPapersLastEvidence papers
Data mining › text mining
topic modeling
0.522016
Topic Modeling of Short Texts: A Pseudo-Document View · KDD 2016
Complementary Aspect-Based Opinion Mining Across Asymmetric Collections · ICDM 2015
Data mining › text mining › topic modeling
short text topic modeling
0.212016
Topic Modeling of Short Texts: A Pseudo-Document View · KDD 2016
Data mining › text mining › sentiment analysis
aspect-based sentiment analysis
0.212015
Complementary Aspect-Based Opinion Mining Across Asymmetric Collections · ICDM 2015
Data mining › text mining › topic modeling
cross-collection topic modeling
0.212015
Complementary Aspect-Based Opinion Mining Across Asymmetric Collections · ICDM 2015
Data mining › text mining
sentiment analysis
0.212015
Complementary Aspect-Based Opinion Mining Across Asymmetric Collections · ICDM 2015
Data mining
pattern mining
0.112016
Topic Modeling of Short Texts: A Pseudo-Document View · KDD 2016
Information retrieval › text analysis
term co-occurrence
0.112016
Topic Modeling of Short Texts: A Pseudo-Document View · KDD 2016

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

spike-and-slab prior · 0.2pseudo-document · 0.2topic model · 0.2maximum entropy model · 0.2
YearPublicationVenuePosition
2016 Robust Word-Network Topic Model for Short Texts
abstract
With the rapid development of online social media, the short text has become the prevalent format for information of Internet. Due to the severe data sparsity issue, accurately discovering knowledge behind these short texts remains a critical challenge. Since regular topic models, such as the Latent Dirichlet Allocation (LDA), can not perform well on short texts, many efforts have been put on building different types of probabilistic topic models for short texts. Inducing topics from dense word-word space instead of sparse document-word space becomes an emerging solution for avoiding data sparsity issue, and the representative one is the Word Network Topic Model (WNTM). However, the word-word space building procedure of WNTM often imports much irrelevant information. In light of this, we propose the Robust WNTM (RWNTM), which can filter out unrelated information during the sampling. The experimental results demonstrate that our method can learn more coherent topics and is more accurate in text classification, as compared with WNTM and other state-of-the-arts.
Fei Wang 0148, Rui Liu 0007, Yuan Zuo, Hui Zhang 0028, Junjie Wu 0002
ICTAI1
2016 Topic Modeling of Short Texts: A Pseudo-Document View
abstract
Recent years have witnessed the unprecedented growth of online social media, which empower short texts as the prevalent format for information of Internet. Given the nature of sparsity, however, short text topic modeling remains a critical yet much-watched challenge in both academy and industry. Rich research efforts have been put on building different types of probabilistic topic models for short texts, among which the self aggregation methods without using auxiliary information become an emerging solution for providing informative cross-text word co-occurrences. However, models along this line are still rarely seen, and the representative one Self-Aggregation Topic Model (SATM) is prone to overfitting and computationally expensive. In light of this, in this paper, we propose a novel probabilistic model called Pseudo-document-based Topic Model (PTM) for short text topic modeling. PTM introduces the concept of pseudo document to implicitly aggregate short texts against data sparsity. By modeling the topic distributions of latent pseudo documents rather than short texts, PTM is expected to gain excellent performance in both accuracy and efficiency. A Sparsity-enhanced PTM (SPTM for short) is also proposed by applying Spike and Slab prior, with the purpose of eliminating undesired correlations between pseudo documents and latent topics. Extensive experiments on various real-world data sets with state-of-the-art baselines demonstrate the high quality of topics learned by PTM and its robustness with reduced training samples. It is also interesting to show that i) SPTM gains a clear edge over PTM when the number of pseudo documents is relatively small, and ii) the constraint that a short text belongs to only one pseudo document is critically important for the success of PTM. We finally take an in-depth semantic analysis to unveil directly the fabulous function of pseudo documents in finding cross-text word co-occurrences for topic modeling.
Yuan Zuo, Junjie Wu 0002, Hui Zhang 0028, Hao Lin 0002, Fei Wang 0148, Ke Xu 0001, Hui Xiong 0001
KDD5
2015 Complementary Aspect-Based Opinion Mining Across Asymmetric Collections
abstract
Aspect-based opinion mining is to find elaborate opinions towards an underlying theme, perspective or viewpoint as to a subject such as a product or an event. Nowadays, with rapid growing of opinionated text on the Web, mining aspect-level opinions has become a promising means for online public opinion analysis. In particular, the booming of various types of online media provide diverse yet complementary information, bringing unprecedented opportunities for public opinion analysis across different populations. Along this line, in this paper, we propose CAMEL, a novel topic model for complementary aspect-based opinion mining across asymmetric collections. CAMEL gains complementarity by modeling both common and specific aspects across different collections, and keeping all the corresponding opinions for contrastive study. To further boost CAMEL, we propose AME, an automatic labeling scheme for maximum entropy model, to help discriminate aspect and opinion words without heavy human labeling. Extensive experiments on synthetic multicollection data sets demonstrate the superiority of CAMEL to baseline methods, in leveraging cross-collection complementarity to find higher-quality aspects and more coherent opinions as well as aspect-opinion relationships. This is particularly true when the collections get seriously imbalanced. Experimental results also show that the AME model indeed outperforms manual labeling in suggesting true opinion words. Finally, case study on two public events further demonstrates the practical value of CAMEL for real-world public opinion analysis.
Yuan Zuo, Junjie Wu 0002, Hui Zhang 0028, Deqing Wang 0001, Hao Lin 0002, Fei Wang 0148, Ke Xu 0001
ICDM6