DNG: Taxonomy Expansion by Exploring the Intrinsic Directed Structure on Non-gaussian Space
Not on the map. Why?
Abstract (arXiv)
Taxonomy expansion is the process of incorporating a large number of additional nodes (i.e., "queries") into an existing taxonomy (i.e., "seed"), with the most important step being the selection of appropriate positions for each query. Enormous efforts have been made by exploring the seed's structure. However, existing approaches are deficient in their mining of structural information in two ways: poor modeling of the hierarchical semantics and failure to capture directionality of is-a relation. This paper seeks to address these issues by explicitly denoting each node as the combination of inherited feature (i.e., structural part) and incremental feature (i.e., supplementary part). Specifically, the inherited feature originates from "parent" nodes and is weighted by an inheritance factor. With this node representation, the hierarchy of semantics in taxonomies (i.e., the inheritance and accumulation of features from "parent" to "child") could be embodied. Additionally, based on this representation, the directionality of is-a relation could be easily translated into the irreversible inheritance of features. Inspired by the Darmois-Skitovich Theorem, we implement this irreversibility by a non-Gaussian constraint on the supplementary feature. A log-likelihood learning objective is further utilized to optimize the proposed model (dubbed DNG), whereby the required non-Gaussianity is also theoretically ensured. Extensive experimental results on two real-world datasets verify the superiority of DNG relative to several strong baselines.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 40 references that are in the map. First posted on arXiv 22 Feb 2023.
Builds on
14 of 40 references.
References · 14
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2020TaxoExpan: Self-supervised Taxonomy Expansion with Position-Enhanced Graph Neural Networkcited by 37
- 2020STEAM: Self-Supervised Taxonomy Expansion with Mini-Pathscited by 31
- 2019Every child should have parents: a taxonomy refinement algorithm based on hyperbolic term embeddingscited by 23
- 2021Taxonomy Completion via Triplet Matching Networkcited by 21
- 2022TaxoEnrich: Self-Supervised Taxonomy Completion via Structure-Semantic Representationscited by 20
- 2021Enhancing Taxonomy Completion with Concept Generation via Fusing Relational Representationscited by 19
- 2021HyperExpan: Taxonomy Expansion with Hyperbolic Representation Learningcited by 14
- 2021Enquire One's Parent and Child Before Decision: Fully Exploit Hierarchical Structure for Self-Supervised Taxonomy Expansioncited by 13
Built on by
Not cited yet.