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

Kailong Jiang

dblp:269/4591 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 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.

Artificial intelligence
1 paper
Information extraction and text analysis · 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 › text classification
short text classification
0.412020
Dataless Short Text Classification Based on Biterm Topic Model and Word Embeddings · IJCAI 2020
Natural language and speech › Information extraction and text analysis
text classification
0.412020
Dataless Short Text Classification Based on Biterm Topic Model and Word Embeddings · IJCAI 2020
Natural language and speech › Information extraction and text analysis
topic model
0.412020
Dataless Short Text Classification Based on Biterm Topic Model and Word Embeddings · IJCAI 2020

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

word embeddings · 0.4topic model · 0.4
YearPublicationVenuePosition
2020 Dataless Short Text Classification Based on Biterm Topic Model and Word Embeddings
abstract
Dataless text classification has attracted increasing attentions recently. It only needs very few seed words of each category to classify documents, which is much cheaper than supervised text classification that requires massive labeling efforts. However, most of existing models pay attention to long texts, but get unsatisfactory performance on short texts, which have become increasingly popular on the Internet. In this paper, we at first propose a novel model named Seeded Biterm Topic Model (SeedBTM) extending BTM to solve the problem of dataless short text classification with seed words. It takes advantage of both word co-occurrence information in the topic model and category-word similarity from widely used word embeddings as the prior topic-in-set knowledge. Moreover, with the same approach, we also propose Seeded Twitter Biterm Topic Model (SeedTBTM), which extends Twitter-BTM and utilizes additional user information to achieve higher classification accuracy. Experimental results on five real short-text datasets show that our models outperform the state-of-the-art methods, and especially perform well when the categories are overlapping and interrelated.
Yi Yang 0060, Hongan Wang, Jiaqi Zhu 0001, Yunkun Wu, Kailong Jiang, Wenli Guo, Wandong Shi
IJCAI5