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

Yiran Chen 0013

dblp:80/1641-13 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-1486-8412ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Language models and text generation · 81% Information extraction and text analysis · 19%
Databases, data mining, and information retrieval
1 paper
Graph data management · 50% Information retrieval · 50%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
text summarization
0.922021
Enhancing Scientific Papers Summarization with Citation Graph · AAAI 2021
Extractive Summarization as Text Matching · ACL 2020
Natural language and speech › Language models and text generation › text summarization › long document summarization
scientific paper summarization
0.512021
Enhancing Scientific Papers Summarization with Citation Graph · AAAI 2021
Graph data management
citation network
0.512021
Enhancing Scientific Papers Summarization with Citation Graph · AAAI 2021
Information retrieval › text summarization
graph-based summarization
0.512021
Enhancing Scientific Papers Summarization with Citation Graph · AAAI 2021
Natural language and speech › Language models and text generation › text summarization
extractive summarization
0.412020
Extractive Summarization as Text Matching · ACL 2020
Natural language and speech › Information extraction and text analysis › lexical semantics › semantic relatedness
semantic text matching
0.412020
Extractive Summarization as Text Matching · ACL 2020

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

pre-trained language model · 1.0citation graph · 1.0neural text matching · 0.4
YearPublicationVenuePosition
2021 Enhancing Scientific Papers Summarization with Citation Graph
abstract
Previous work for text summarization in scientific domain mainly focused on the content of the input document, but seldom considering its citation network. However, scientific papers are full of uncommon domain-specific terms, making it almost impossible for the model to understand its true meaning without the help of the relevant research community. In this paper, we redefine the task of scientific papers summarization by utilizing their citation graph and propose a citation graph-based summarization model CGSum which can incorporate the information of both the source paper and its references. In addition, we construct a novel scientific papers summarization dataset Semantic Scholar Network (SSN) which contains 141K research papers in different domains and 661K citation relationships. The entire dataset constitutes a large connected citation graph. Extensive experiments show that our model can achieve competitive performance when compared with the pretrained models even with a simple architecture. The results also indicates the citation graph is crucial to better understand the content of papers and generate high-quality summaries.
Chenxin An, Ming Zhong 0005, Yiran Chen 0013, Danqing Wang, Xipeng Qiu, Xuanjing Huang 0001
AAAI3
2020 Extractive Summarization as Text Matching
abstract
This paper creates a paradigm shift with regard to the way we build neural extractive summarization systems.Instead of following the commonly used framework of extracting sentences individually and modeling the relationship between sentences, we formulate the extractive summarization task as a semantic text matching problem, in which a source document and candidate summaries will be (extracted from the original text) matched in a semantic space.Notably, this paradigm shift to semantic matching framework is well-grounded in our comprehensive analysis of the inherent gap between sentence-level and summary-level extractors based on the property of the dataset.Besides, even instantiating the framework with a simple form of a matching model, we have driven the state-of-the-art extractive result on CNN/DailyMail to a new level (44.41 in ROUGE-1).Experiments on the other five datasets also show the effectiveness of the matching framework.We believe the power of this matching-based summarization framework has not been fully exploited.To encourage more instantiations in the future, we have released our codes, processed dataset, as well as generated summaries in https://github. com/maszhongming/MatchSum.
Ming Zhong 0005, Pengfei Liu 0003, Yiran Chen 0013, Danqing Wang, Xipeng Qiu, Xuanjing Huang 0001
ACL3