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.

Jiashu Cheng

dblp:266/4557 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 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
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
paraphrase extraction
0.412020
The Value of Paraphrase for Knowledge Base Predicates · AAAI 2020
Knowledge graphs
knowledge graph construction
0.412020
The Value of Paraphrase for Knowledge Base Predicates · AAAI 2020

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

machine mining · 0.9crowdsourcing · 0.9
YearPublicationVenuePosition
2025 Enhancing Radiology Report Interpretation through Modality-Specific RadGraph Fine-Tuning
Haoyue Guan, Yuwei Dai, Shadi Afyouni, Alec Kain, Wen-Chi Hsu, Jiashu Cheng, Sophie Yao, Yuli Wang, Rishitha Pulakhandam, Lin-Mei Zhao, Chengzhang Zhu, Zhicheng Jiao, Craig Jones, Harrison Bai
MICCAI (7)6
2020 The Value of Paraphrase for Knowledge Base Predicates
abstract
Paraphrase, i.e., differing textual realizations of the same meaning, has proven useful for many natural language processing (NLP) applications. Collecting paraphrase for predicates in knowledge bases (KBs) is the key to comprehend the RDF triples in KBs. Existing works have published some paraphrase datasets automatically extracted from large corpora, but have too many redundant pairs or don't cover enough predicates, which cannot be improved by computer only and need the help of human beings. This paper shows a full process of collecting large-scale and high-quality paraphrase dictionaries for predicates in knowledge bases, which takes advantage of existing datasets and combines the technologies of machine mining and crowdsourcing. Our dataset comprises 2284 distinct predicates in DBpedia and 31130 paraphrase pairs in total, the quality of which is a great leap over previous works. Then it is demonstrated that such good paraphrase dictionaries can do great help to natural language processing tasks such as question answering and language generation. We also publish our own dictionary for further research.
Bingcong Xue, Sen Hu 0005, Lei Zou 0001, Jiashu Cheng
AAAI4