mlsanityData to 7 Oct 2026

Enquire One's Parent and Child Before Decision: Fully Exploit Hierarchical Structure for Self-Supervised Taxonomy Expansion

arXiv 2101.11268 ↗First posted 27 Jan 2021cs.CL cs.AI cs.IRcited by 13

Not on the map. Why?

Abstract (arXiv)

Taxonomy is a hierarchically structured knowledge graph that plays a crucial role in machine intelligence. The taxonomy expansion task aims to find a position for a new term in an existing taxonomy to capture the emerging knowledge in the world and keep the taxonomy dynamically updated. Previous taxonomy expansion solutions neglect valuable information brought by the hierarchical structure and evaluate the correctness of merely an added edge, which downgrade the problem to node-pair scoring or mini-path classification. In this paper, we propose the Hierarchy Expansion Framework (HEF), which fully exploits the hierarchical structure's properties to maximize the coherence of expanded taxonomy. HEF makes use of taxonomy's hierarchical structure in multiple aspects: i) HEF utilizes subtrees containing most relevant nodes as self-supervision data for a complete comparison of parental and sibling relations; ii) HEF adopts a coherence modeling module to evaluate the coherence of a taxonomy's subtree by integrating hypernymy relation detection and several tree-exclusive features; iii) HEF introduces the Fitting Score for position selection, which explicitly evaluates both path and level selections and takes full advantage of parental relations to interchange information for disambiguation and self-correction. Extensive experiments show that by better exploiting the hierarchical structure and optimizing taxonomy's coherence, HEF vastly surpasses the prior state-of-the-art on three benchmark datasets by an average improvement of 46.7% in accuracy and 32.3% in mean reciprocal rank.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 22 of its 54 references that are in the map. First posted on arXiv 27 Jan 2021.

Builds on

22 of 54 references.

References · 22

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  4. 2018Self-Attention with Relative Position Representationscited by 1,112
  5. 2015Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networkscited by 305
  6. 2020Code Prediction by Feeding Trees to Transformerscited by 70
  7. 2019Inferring Concept Hierarchies from Text Corpora via Hyperbolic Embeddingscited by 49
  8. 2018TaxoGen: Unsupervised Topic Taxonomy Construction by Adaptive Term Embedding and Clusteringcited by 48
  9. 2020TaxoExpan: Self-supervised Taxonomy Expansion with Position-Enhanced Graph Neural Networkcited by 37
  10. 2019Hierarchical Taxonomy-Aware and Attentional Graph Capsule RCNNs for Large-Scale Multi-Label Text Classificationcited by 31
  11. 2019HiExpan: Task-Guided Taxonomy Construction by Hierarchical Tree Expansioncited by 31
  12. 2020STEAM: Self-Supervised Taxonomy Expansion with Mini-Pathscited by 31
10 more
  1. 2020TXtract: Taxonomy-Aware Knowledge Extraction for Thousands of Product Categoriescited by 29
  2. 2016Improving Hypernymy Detection with an Integrated Path-based and Distributional Methodcited by 26
  3. 2018Hearst Patterns Revisited: Automatic Hypernym Detection from Large Text Corporacited by 26
  4. 2020AliCoCo: Alibaba E-commerce Cognitive Concept Netcited by 23
  5. 2018End-to-End Reinforcement Learning for Automatic Taxonomy Inductioncited by 17
  6. 2017MetaPAD: Meta Pattern Discovery from Massive Text Corporacited by 12
  7. 2019A User-Centered Concept Mining System for Query and Document Understanding at Tencentcited by 11
  8. 2020GIANT: Scalable Creation of a Web-scale Ontologycited by 6
  9. 2017Taxonomy Induction using Hypernym Subsequencescited by 4
  10. 2018Term Definitions Help Hypernymy Detectioncited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 3; 2024: 3; 2025: 1; 2026: 2.

13 papers.

Sort: