arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.10419cs.IRcs.CLcs.LG
收藏

一种增强标签分配的层次文本分类方法

Hierarchical Text Classification with Reinforced Label Assignment

University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Peking University(北京大学);University of Southern California(南加州大学)

Yuning Mao, Jingjing Tian, Jiawei Han, Xiang Ren

摘要:

虽然现有的分层文本分类(HTC)方法试图捕捉标签层次结构的模型训练,他们要么对每个标签的本地决策或完全忽略的层次信息在推理。为了解决训练和推理之间的不匹配以及以更原则的方式对标签依赖性进行建模,我们将HTC制定为马尔可夫决策过程,并建议通过深度强化学习来学习标签分配策略,以确定在何处放置对象以及何时停止分配过程。所提出的方法Hierarchy以一致的方式在训练和推理时间期间探索层次结构,并做出相互依赖的决策。作为一个通用框架,Hierarchy可以将不同的神经编码器作为端到端训练的基础模型。在五个公共数据集和四个基本模型上的实验表明,Hierarchy在Macro-F1中的平均性能比平面分类器提高了33.4%,并且比最先进的HTC方法有很大的提高。数据和代码可以在https://github.com/morningmoni/HiLAP上找到。

英文摘要:

While existing hierarchical text classification (HTC) methods attempt to capture label hierarchies for model training, they either make local decisions regarding each label or completely ignore the hierarchy information during inference. To solve the mismatch between training and inference as well as modeling label dependencies in a more principled way, we formulate HTC as a Markov decision process and propose to learn a Label Assignment Policy via deep reinforcement learning to determine where to place an object and when to stop the assignment process. The proposed method, HiLAP, explores the hierarchy during both training and inference time in a consistent manner and makes inter-dependent decisions. As a general framework, HiLAP can incorporate different neural encoders as base models for end-to-end training. Experiments on five public datasets and four base models show that HiLAP yields an average improvement of 33.4% in Macro-F1 over flat classifiers and outperforms state-of-the-art HTC methods by a large margin. Data and code can be found at https://github.com/morningmoni/HiLAP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑