2021
DOI: 10.48550/arxiv.2101.01896
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Taxonomy Completion via Triplet Matching Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(8 citation statements)
references
References 30 publications
0
8
0
Order By: Relevance
“…However, for every node in the existing taxonomy, all concepts in C can be taken as candidates of hyponym, thus the potential search space is incredibly enormous. Previous studies [16]- [19], [23] address the above problem via an assumption that the input set of new concepts contains only one element (i.e., |C| = 1), and aims to find one single parent node in the existing taxonomy T 0 of this new concept (i.e., |R| = 1). This simplification not only limits expansion in the depth of taxonomies, but also neglects the truth that a new concept has multiple parent nodes.…”
Section: B Problem Definitionmentioning
confidence: 99%
See 1 more Smart Citation
“…However, for every node in the existing taxonomy, all concepts in C can be taken as candidates of hyponym, thus the potential search space is incredibly enormous. Previous studies [16]- [19], [23] address the above problem via an assumption that the input set of new concepts contains only one element (i.e., |C| = 1), and aims to find one single parent node in the existing taxonomy T 0 of this new concept (i.e., |R| = 1). This simplification not only limits expansion in the depth of taxonomies, but also neglects the truth that a new concept has multiple parent nodes.…”
Section: B Problem Definitionmentioning
confidence: 99%
“…Prior studies like [58], [59] require manual training data to learn features. Self-supervised constructing training set from existing taxonomy is a common strategy considered to address this problem in recent works [16], [18], [19], [23]. In our work, we further propose an adaptively self-supervised generation strategy to avoid inheriting the adverse problems in the existing taxonomy.…”
Section: B Taxonomy Expansionmentioning
confidence: 99%
“…Figure 3 illustrates an example of an ego tree. A similar approach has also been used in (Wang et al, 2021;Yu et al, 2020b;Zhang et al, 2021;Shen et al, 2020) studies. To obtain the embedding of the anchor concept, we further apply graph embedding as described below.…”
Section: Team-regression (Team-rg)mentioning
confidence: 99%
“…Though both of these operations are integral parts of a WordNet taxonomy expansion, all of the existing studies on taxonomy expansion have considered expansion with either attach operation (Schlichtkrull and Alonso, 2016;Vedula et al, 2018;Shen et al, 2020;Yu et al, 2020b;Zhang et al, 2021;Takeoka et al, 2021; or merge operation (Nakashole et al, 2012;Nguyen et al, 2017;Nakashole et al, 2012;Qu et al, 2017;Boteanu et al, 2018;Wang et al, 2019;Fei et al, 2019), but not together. Realizing the need to apply both the operation, SemEval-2016:task 14 (Semantic taxonomy enrichment) Jurgens and Pilehvar (2016) includes a call for expansion with both attach and merge operations.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation