mlsanityData to 14 Oct 2026

Combining Language and Topic Models for Hierarchical Text Classification

arXiv 2507.16490 ↗First posted 22 Jul 2025cs.CL cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Hierarchical text classification (HTC) is a natural language processing task which has the objective of categorising text documents into a set of classes from a predefined structured class hierarchy. Recent HTC approaches use various techniques to incorporate the hierarchical class structure information with the natural language understanding capabilities of pre-trained language models (PLMs) to improve classification performance. Furthermore, using topic models along with PLMs to extract features from text documents has been shown to be an effective approach for multi-label text classification tasks. The rationale behind the combination of these feature extractor models is that the PLM captures the finer-grained contextual and semantic information while the topic model obtains high-level representations which consider the corpus of documents as a whole. In this paper, we use a HTC approach which uses a PLM and a topic model to extract features from text documents which are used to train a classification model. Our objective is to determine whether the combination of the features extracted from the two models is beneficial to HTC performance in general. In our approach, the extracted features are passed through separate convolutional layers whose outputs are combined and passed to a label-wise attention mechanisms which obtains label-specific document representations by weighing the most important features for each class separately. We perform comprehensive experiments on three HTC benchmark datasets and show that using the features extracted from the topic model generally decreases classification performance compared to only using the features obtained by the PLM. In contrast to previous work, this shows that the incorporation of features extracted from topic models for text classification tasks should not be assumed beneficial.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 39 references that are in the map. First posted on arXiv 22 Jul 2025.

Builds on

18 of 39 references.

References · 18

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  5. 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,811
  6. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,254
  7. 2022BERTopic: Neural topic modeling with a class-based TF-IDF procedurecited by 801
  8. 2018Explainable Prediction of Medical Codes from Clinical Textcited by 234
  9. 2017HDLTex: Hierarchical Deep Learning for Text Classificationcited by 106
  10. 2022Incorporating Hierarchy into Text Encoder: a Contrastive Learning Approach for Hierarchical Text Classificationcited by 52
  11. 2019Hierarchical Text Classification with Reinforced Label Assignmentcited by 41
  12. 2019Learning to Learn and Predict: A Meta-Learning Approach for Multi-Label Classificationcited by 35
6 more
  1. 2019Hierarchical Taxonomy-Aware and Attentional Graph Capsule RCNNs for Large-Scale Multi-Label Text Classificationcited by 32
  2. 2022HPT: Hierarchy-aware Prompt Tuning for Hierarchical Text Classificationcited by 31
  3. 2021HTCInfoMax: A Global Model for Hierarchical Text Classification via Information Maximizationcited by 25
  4. 2022Exploiting Global and Local Hierarchies for Hierarchical Text Classificationcited by 15
  5. 2022Hierarchical Label-wise Attention Transformer Model for Explainable ICD Codingcited by 13
  6. 2024Introducing Three New Benchmark Datasets for Hierarchical Text Classificationcited by 1

Built on by

Not cited yet.