paper-with-me

홈 › Papers

Taxonomy Completion via Triplet Matching Network

2021-01-06 · Jieyu Zhang, Xiangchen Song, Ying Zeng, Jiaze Chen, Jiaming Shen, Yuning Mao, Lei LI

Automatically constructing taxonomy finds many applications in e-commerce and web search. One critical challenge is as data and business scope grow in real applications, new concepts are emerging and needed to be added to the existing taxonomy. Previous approaches focus on the taxonomy expansion, i.e. finding an appropriate hypernym concept from the taxonomy for a new query concept. In this paper, we formulate a new task, "taxonomy completion", by discovering both the hypernym and hyponym concepts for a query. We propose Triplet Matching Network (TMN), to find the appropriate <hypernym, hyponym> pairs for a given query concept. TMN consists of one primal scorer and multiple auxiliary scorers. These auxiliary scorers capture various fine-grained signals (e.g., query to hypernym or query to hyponym semantics), and the primal scorer makes a holistic prediction on <query, hypernym, hyponym> triplet based on the internal feature representations of all auxiliary scorers. Also, an innovative channel-wise gating mechanism that retains task-specific information in concept representations is introduced to further boost model performance. Experiments on four real-world large-scale datasets show that TMN achieves the best performance on both taxonomy completion task and the previous taxonomy expansion task, outperforming existing methods.

📄 PDF Abstract BibTeX arXiv:2101.01896

Code (1)

JieyuZ2/TMN 공식 구현 pytorch

Tasks

Taxonomy ExpansionTriplet

Similar Papers 제목 키워드 기반

TaxoEnrich: Self-Supervised Taxonomy Completion via Structure-Semantic Representations

2022-02-10 · Minhao Jiang, Xiangchen Song, Jieyu Zhang, Jiawei Han

Taxonomies are fundamental to many real-world applications in various domains, serving as structural representations of knowledge. To deal with the increasing volume of new concepts needed to be organized as taxonomies, …

Position

Distance-Adaptive Quaternion Knowledge Graph Embedding with Bidirectional Rotation

2024-12-05 · Weihua Wang, Qiuyu Liang, Feilong Bao, Guanglai Gao

Quaternion contains one real part and three imaginary parts, which provided a more expressive hypercomplex space for learning knowledge graph. Existing quaternion embedding models measure the plausibility of a triplet ei…

Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingLink Prediction+2

Improving Hyper-Relational Knowledge Graph Completion

2021-04-16 · Donghan Yu, Yiming Yang

Different from traditional knowledge graphs (KGs) where facts are represented as entity-relation-entity triplets, hyper-relational KGs (HKGs) allow triplets to be associated with additional relation-entity pairs (a.k.a q…

Computational EfficiencyGraph Neural NetworkKnowledge Graph CompletionKnowledge Graphs+2

Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs

2026-06-29 · Zihao Zheng, Borui Cai, Yao Zhao, Xin Han 외 arxiv

Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications. Due to their inherent incompleteness, knowledge graph completion (KGC) is widely studied and is typically formul…

Knowledge Graph CompletionKnowledge GraphsLink Prediction

Hierarchical Relational Learning for Few-Shot Knowledge Graph Completion

2022-09-02 · Han Wu, Jie Yin, Bala Rajaratnam, Jianyuan Guo

Knowledge graphs (KGs) are known for their large scale and knowledge inference ability, but are also notorious for the incompleteness associated with them. Due to the long-tail distribution of the relations in KGs, few-s…

Knowledge Graph CompletionKnowledge GraphsRelational ReasoningTriplet