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

Kerui Zhu

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

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

Artificial intelligence and machine learning · 2 · 2 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 · 32% Knowledge representation and reasoning · 32% Information extraction and text analysis · 28%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › text generation › knowledge-grounded generation
commonsense generation
0.712023
DimonGen: Diversified Generative Commonsense Reasoning for Explaining Concept Relationships · ACL (1) 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
commonsense reasoning
0.712023
DimonGen: Diversified Generative Commonsense Reasoning for Explaining Concept Relationships · ACL (1) 2023
Knowledge graphs › knowledge graph explanation
entity relationship explanation
0.612022
DEER: Descriptive Knowledge Graph for Explaining Entity Relationships · EMNLP 2022
Machine learning › Generative modeling › autoregressive model
transformer-based generation
0.212022
DEER: Descriptive Knowledge Graph for Explaining Entity Relationships · EMNLP 2022

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

transformer · 1.1self-supervised learning · 1.1dependency parsing · 1.1mixture of retrievers · 0.7mixture of generators · 0.7
YearPublicationVenuePosition
2023 DimonGen: Diversified Generative Commonsense Reasoning for Explaining Concept Relationships
abstract
In this paper, we propose DimonGen, which aims to generate diverse sentences describing concept relationships in various everyday scenarios.To support this, we first create a benchmark dataset for this task by adapting the existing CommonGen dataset.We then propose a two-stage model called MoREE to generate the target sentences.MoREE consists of a mixture of retrievers model that retrieves diverse context sentences related to the given concepts, and a mixture of generators model that generates diverse sentences based on the retrieved contexts.We conduct experiments on the DimonGen task and show that MoREE outperforms strong baselines in terms of both the quality and diversity of the generated sentences.Our results demonstrate that MoREE is able to generate diverse sentences that reflect different relationships between concepts, leading to a comprehensive understanding of concept relationships. 1
Chenzhengyi Liu, Jie Huang 0009, Kerui Zhu, Kevin Chen-Chuan Chang
ACL (1)3
2022 DEER: Descriptive Knowledge Graph for Explaining Entity Relationships
abstract
We propose DEER (Descriptive Knowledge Graph for Explaining Entity Relationships)an open and informative form of modeling entity relationships.In DEER, relationships between entities are represented by free-text relation descriptions.For instance, the relationship between entities of machine learning and algorithm can be represented as "Machine learning explores the study and construction of algorithms that can learn from and make predictions on data."To construct DEER, we propose a self-supervised learning method to extract relation descriptions with the analysis of dependency patterns and generate relation descriptions with a transformer-based relation description synthesizing model, where no human labeling is required.Experiments demonstrate that our system can extract and generate highquality relation descriptions for explaining entity relationships.The results suggest that we can build an open and informative knowledge graph without human annotation.
Jie Huang 0009, Kerui Zhu, Kevin Chen-Chuan Chang, Jinjun Xiong, Wen-Mei W. Hwu
EMNLP2