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

Daichuan Yang

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

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

Artificial intelligence and machine learning · 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 · 75% Knowledge representation and reasoning · 25%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › relation extraction
joint entity and relation extraction
0.512021
TDEER: An Efficient Translating Decoding Schema for Joint Extraction of Entities and Relations · EMNLP (1) 2021
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition
knowledge base construction
0.512021
TDEER: An Efficient Translating Decoding Schema for Joint Extraction of Entities and Relations · EMNLP (1) 2021
Natural language and speech › Information extraction and text analysis
relation extraction
0.512021
TDEER: An Efficient Translating Decoding Schema for Joint Extraction of Entities and Relations · EMNLP (1) 2021
Natural language and speech › Information extraction and text analysis › relation extraction
triple extraction
0.512021
TDEER: An Efficient Translating Decoding Schema for Joint Extraction of Entities and Relations · EMNLP (1) 2021

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

translating decoding schema · 0.5negative sampling · 0.5
YearPublicationVenuePosition
2021 TDEER: An Efficient Translating Decoding Schema for Joint Extraction of Entities and Relations
abstract
Joint extraction of entities and relations from unstructured texts to form factual triples is a fundamental task of constructing a Knowledge Base (KB).A common method is to decode triples by predicting entity pairs to obtain the corresponding relation.However, it is still challenging to handle this task efficiently, especially for the overlapping triple problem.To address such a problem, this paper proposes a novel efficient entities and relations extraction model called TDEER, which stands for Translating Decoding Schema for Joint Extraction of Entities and Relations.Unlike the common approaches, the proposed translating decoding schema regards the relation as a translating operation from subject to objects, i.e., TDEER decodes triples as subject + relation → objects.TDEER can naturally handle the overlapping triple problem, because the translating decoding schema can recognize all possible triples, including overlapping and non-overlapping triples.To enhance model robustness, we introduce negative samples to alleviate error accumulation at different stages.Extensive experiments on public datasets demonstrate that TDEER produces competitive results compared with the state-of-the-art (SOTA) baselines.Furthermore, the computation complexity analysis indicates that TDEER is more efficient than powerful baselines.Especially, the proposed TDEER is 2 times faster than the recent SOTA models.The code is available at https://github.com/4AI/TDEER.
Xianming Li, Xiaotian Luo 0001, Chenghao Dong, Daichuan Yang, Beidi Luan
EMNLP (1)4