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

Wandong Shi

dblp:269/4601 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Graphics, 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
2 papers
Information extraction and text analysis · 70% Transfer learning and domain adaptation · 30%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.512021
Knowledge-Enhanced Domain Adaptation in Few-Shot Relation Classification · KDD 2021
Machine learning › Transfer learning and domain adaptation › domain adaptation › low-resource domain adaptation
few-shot domain adaptation
0.512021
Knowledge-Enhanced Domain Adaptation in Few-Shot Relation Classification · KDD 2021
Natural language and speech › Information extraction and text analysis › relation extraction › relation classification
few-shot relation classification
0.512021
Knowledge-Enhanced Domain Adaptation in Few-Shot Relation Classification · KDD 2021
Natural language and speech › Information extraction and text analysis › relation extraction
relation classification
0.512021
Knowledge-Enhanced Domain Adaptation in Few-Shot Relation Classification · KDD 2021
Knowledge graphs
knowledge-enhanced learning
0.512021
Knowledge-Enhanced Domain Adaptation in Few-Shot Relation Classification · KDD 2021
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

prototypical network · 1.0meta-learning · 1.0knowledge graph · 1.0word embeddings · 0.4topic model · 0.4
YearPublicationVenuePosition
2021 Effective Seed-Guided Topic Labeling for Dataless Hierarchical Short Text Classification
Yi Yang 0060, Hongan Wang, Jiaqi Zhu 0001, Wandong Shi, Wenli Guo, Jiawen Zhang 0001
ICWE4
2021 Knowledge-Enhanced Domain Adaptation in Few-Shot Relation Classification
abstract
Relation classification (RC) is an important task in knowledge extraction from texts, while data-driven approaches, although achieving high performance, heavily rely on a large amount of annotated training data. Recently, many few-shot RC models have been proposed and yielded promising results in general domain datasets, but when adapting to a specific domain, such as medicine, the performance drops dramatically. In this paper, we propose a Knowledge-Enhanced Few-shot RC model for the Domain Adaptation task (KEFDA), which incorporates general and domain-specific knowledge graphs (KGs) to the RC model to improve its domain adaptability. With the help of concept-level KGs, the model can better understand the semantics of texts and easily summarize the global semantics of relation types from only a few instances. To be more important, as a kind of meta-information, the manner of utilizing KGs can be transferred from existing tasks to new tasks, even across domains. Specifically, we design a knowledge-enhanced prototypical network to conduct instance matching, and a relation-meta learning network for implicit relation matching. The two scoring functions are combined to infer the relation type of a new instance. Experimental results on the Domain Adaptation Challenge in the FewRel 2.0 benchmark demonstrate that our approach significantly outperforms the state-of-the-art models (by 6.63% on average).
Jiawen Zhang 0001, Jiaqi Zhu 0001, Yi Yang 0060, Wandong Shi, Hongan Wang
KDD4
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
IJCAI7