Hao Peng, Philip Yu, Jianxin Li, Dongxiao He, Zhongfen Deng
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The current state-of-the-art model HiAGM for hierarchical text classification has two limitations. First, it correlates each text sample with all labels in the dataset which contains irrelevant information. Second, it does not consider any statistical constraint on the label representations learned by the structure encoder, while constraints for representation learning are proved to be helpful in previous work. In this paper, we propose HTCInfoMax to address these issues by introducing information maximization which includes two modules: text-label mutual information maximization and label prior matching. The first module can model the interaction between each text sample and its ground truth labels explicitly which filters out irrelevant information. The second one encourages the structure encoder to learn better representations with desired characteristics for all labels which can better handle label imbalance in hierarchical text classification. Experimental results on two benchmark datasets demonstrate the effectiveness of the proposed HTCInfoMax.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2104.05220")
get_code_for_paper("2104.05220")
have("2104.05220")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2104.05220.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2104.05220)
Connect an agent — have() is free.