mlsanityData to 7 Oct 2026

Minimally-Supervised Structure-Rich Text Categorization via Learning on Text-Rich Networks

arXiv 2102.11479 ↗First posted 23 Feb 2021cs.CLcited by 11

Not on the map. Why?

Abstract (arXiv)

Text categorization is an essential task in Web content analysis. Considering the ever-evolving Web data and new emerging categories, instead of the laborious supervised setting, in this paper, we focus on the minimally-supervised setting that aims to categorize documents effectively, with a couple of seed documents annotated per category. We recognize that texts collected from the Web are often structure-rich, i.e., accompanied by various metadata. One can easily organize the corpus into a text-rich network, joining raw text documents with document attributes, high-quality phrases, label surface names as nodes, and their associations as edges. Such a network provides a holistic view of the corpus' heterogeneous data sources and enables a joint optimization for network-based analysis and deep textual model training. We therefore propose a novel framework for minimally supervised categorization by learning from the text-rich network. Specifically, we jointly train two modules with different inductive biases -- a text analysis module for text understanding and a network learning module for class-discriminative, scalable network learning. Each module generates pseudo training labels from the unlabeled document set, and both modules mutually enhance each other by co-training using pooled pseudo labels. We test our model on two real-world datasets. On the challenging e-commerce product categorization dataset with 683 categories, our experiments show that given only three seed documents per category, our framework can achieve an accuracy of about 92%, significantly outperforming all compared methods; our accuracy is only less than 2% away from the supervised BERT model trained on about 50K labeled documents.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 22 of its 43 references that are in the map. First posted on arXiv 23 Feb 2021.

Builds on

22 of 43 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. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2017Graph Attention Networkscited by 8,854
  5. 2017Inductive Representation Learning on Large Graphscited by 6,284
  6. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  7. 2017Prototypical Networks for Few-shot Learningcited by 3,001
  8. 2016Matching Networks for One Shot Learningcited by 2,246
  9. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
  10. 2019EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Taskscited by 800
  11. 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
  12. 2018Graph Convolutional Networks for Text Classificationcited by 345
10 more
  1. 2016Adversarial Training Methods for Semi-Supervised Text Classificationcited by 280
  2. 2018Contextual Augmentation: Data Augmentation by Words with Paradigmatic Relationscited by 201
  3. 2020Scaling Graph Neural Networks with Approximate PageRankcited by 174
  4. 2019Learning to Self-Train for Semi-Supervised Few-Shot Classificationcited by 83
  5. 2020Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networkscited by 77
  6. 2017Automated Phrase Mining from Massive Text Corporacited by 70
  7. 2018Weakly-Supervised Neural Text Classificationcited by 66
  8. 2021Large-Scale Training System for 100-Million Classification at Alibabacited by 10
  9. 2020Minimally Supervised Categorization of Text with Metadatacited by 8
  10. 2018Improved Semantic-Aware Network Embedding with Fine-Grained Word Alignmentcited by 3

Built on by

Cited by year (2026 to 7 Oct)

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

11 papers.