Enhancing Hierarchical Text Classification through DynamicPath Pruning in Large Language Models

A novel hierarchical multi-label text classification model based on dynamic path pruning of large language models is proposed to address the limitations of existing algorithms in leveraging multi-level label samples and mining dependency relationships.This model utilizes the dynamic path pruning capability of large models to optimize hierarchical multi-granularity recognition and enhance the stability of graph neural networks.By harnessing the semantic perception capabilities of large models, the proposed model facilitates semantic feature encoding and extracts summary information and co-occurrence structures from domain-specific texts.Additionally, it employs graph neural networks for feature encoding, integrates text summaries with dependency relationship information, and merges original data through a semantic-guided attention mechanism to strengthen hierarchical feature analysis.Experimental results demonstrate that the proposed hierarchical text classification model based on dynamic path pruning performs exceptionally well on the WOS and RCV1-V2 datasets, exhibiting superior performance and greater resilience against data perturbations compared to other state-of-the-art models.

Authors

Institutions

Publication Details

Published
2024-09-27
DOI
https://doi.org/10.1145/3701100.3701113
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancing Hierarchical Text Classification through DynamicPath Pruning in Large Language Models

Wenhao Fu, Zheng Song
Topic Modeling
article

Enhancing Hierarchical Text Classification through DynamicPath Pruning in Large Language Models

Wenhao Fu, Zheng Song
article en

Abstract

A novel hierarchical multi-label text classification model based on dynamic path pruning of large language models is proposed to address the limitations of existing algorithms in leveraging multi-level label samples and mining dependency relationships.This model utilizes the dynamic path pruning capability of large models to optimize hierarchical multi-granularity recognition and enhance the stability of graph neural networks.By harnessing the semantic perception capabilities of large models, the proposed model facilitates semantic feature encoding and extracts summary information and co-occurrence structures from domain-specific texts.Additionally, it employs graph neural networks for feature encoding, integrates text summaries with dependency relationship information, and merges original data through a semantic-guided attention mechanism to strengthen hierarchical feature analysis.Experimental results demonstrate that the proposed hierarchical text classification model based on dynamic path pruning performs exceptionally well on the WOS and RCV1-V2 datasets, exhibiting superior performance and greater resilience against data perturbations compared to other state-of-the-art models.

Ministry of Public Security of the People's Republic of China (CN)
Quality Education
Openalex Percentile: Top 76%
Topic Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.