Taxonomy Completion via Triplet Matching Network
- URL: http://arxiv.org/abs/2101.01896v3
- Date: Thu, 4 Mar 2021 09:51:39 GMT
- Title: Taxonomy Completion via Triplet Matching Network
- Authors: Jieyu Zhang, Xiangchen Song, Ying Zeng, Jiaze Chen, Jiaming Shen,
Yuning Mao, Lei Li
- Abstract summary: 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 achieves the best performance on both taxonomy completion task and the previous taxonomy expansion task, outperforming existing methods.
- Score: 18.37146040410778
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Towards Visual Taxonomy Expansion [50.462998483087915]
We propose Visual Taxonomy Expansion (VTE), introducing visual features into the taxonomy expansion task.
We propose a textual hypernymy learning task and a visual prototype learning task to cluster textual and visual semantics.
Our method is evaluated on two datasets, where we obtain compelling results.
arXiv Detail & Related papers (2023-09-12T10:17:28Z) - GANTEE: Generative Adversatial Network for Taxonomy Entering Evaluation [19.036529022923194]
The traditional taxonomy expansion task aims at finding the best position for new coming concepts in the existing taxonomy.
The previous methods suffer from low-efficiency since they waste much time when most of the new coming concepts are indeed noisy concepts.
This paper proposes a pluggable framework called Generative Adversarial Network for Taxonomy Entering Evaluation (GANTEE) to alleviate these drawbacks.
arXiv Detail & Related papers (2023-03-25T14:24:50Z) - Query-Guided Networks for Few-shot Fine-grained Classification and
Person Search [93.80556485668731]
Few-shot fine-grained classification and person search appear as distinct tasks and literature has treated them separately.
We propose a novel unified Query-Guided Network (QGN) applicable to both tasks.
QGN improves on a few recent few-shot fine-grained datasets, outperforming other techniques on CUB by a large margin.
arXiv Detail & Related papers (2022-09-21T10:25:32Z) - TaxoEnrich: Self-Supervised Taxonomy Completion via Structure-Semantic
Representations [28.65753036636082]
We propose a new taxonomy completion framework, which effectively leverages both semantic features and structural information in the existing taxonomy.
TaxoEnrich consists of four components: (1) taxonomy-contextualized embedding which incorporates both semantic meanings of concept and taxonomic relations based on powerful pretrained language models; (2) a taxonomy-aware sequential encoder which learns candidate position representations by encoding the structural information of taxonomy.
Experiments on four large real-world datasets from different domains show that TaxoEnrich achieves the best performance among all evaluation metrics and outperforms previous state-of-the-art by a large margin.
arXiv Detail & Related papers (2022-02-10T08:10:43Z) - Who Should Go First? A Self-Supervised Concept Sorting Model for
Improving Taxonomy Expansion [50.794640012673064]
As data and business scope grow in real applications, existing need to be expanded to incorporate new concepts.
Previous works on taxonomy expansion process the new concepts independently and simultaneously, ignoring the potential relationships among them and the appropriate order of inserting operations.
We propose TaxoOrder, a novel self-supervised framework that simultaneously discovers the local hypernym-hyponym structure among new concepts and decides the order of insertion.
arXiv Detail & Related papers (2021-04-08T11:00:43Z) - Octet: Online Catalog Taxonomy Enrichment with Self-Supervision [67.26804972901952]
We present a self-supervised end-to-end framework, Octet for Online Catalog EnrichmenT.
We propose to train a sequence labeling model for term extraction and employ graph neural networks (GNNs) to capture the taxonomy structure.
Octet enriches an online catalog in production to 2 times larger in the open-world evaluation.
arXiv Detail & Related papers (2020-06-18T04:53:07Z) - STEAM: Self-Supervised Taxonomy Expansion with Mini-Paths [53.45704816829921]
We propose a self-supervised taxonomy expansion model named STEAM.
STEAM generates natural self-supervision signals, and formulates a node attachment prediction task.
Experiments show STEAM outperforms state-of-the-art methods for taxonomy expansion by 11.6% in accuracy and 7.0% in mean reciprocal rank.
arXiv Detail & Related papers (2020-06-18T00:32:53Z) - TaxoExpan: Self-supervised Taxonomy Expansion with Position-Enhanced
Graph Neural Network [62.12557274257303]
Taxonomies consist of machine-interpretable semantics and provide valuable knowledge for many web applications.
We propose a novel self-supervised framework, named TaxoExpan, which automatically generates a set of query concept, anchor concept> pairs from the existing taxonomy as training data.
We develop two innovative techniques in TaxoExpan: (1) a position-enhanced graph neural network that encodes the local structure of an anchor concept in the existing taxonomy, and (2) a noise-robust training objective that enables the learned model to be insensitive to the label noise in the self-supervision data.
arXiv Detail & Related papers (2020-01-26T21:30:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.