Online learning systems have multiple data repositories in the form of transcripts, books and questions. To enable ease of access, such systems organize the content according to a well defined taxonomy of hierarchical nature (subject-chapter-topic). The task of categorizing inputs to the hierarchical labels is usually cast as a flat multi-class classification problem. Such approaches ignore the semantic relatedness between the terms in the input and the tokens in the hierarchical labels. Alternate approaches also suffer from class imbalance when they only consider leaf level nodes as labels. To tackle the issues, we formulate the task as a dense retrieval problem to retrieve the appropriate hierarchical labels for each content. In this paper, we deal with categorizing questions. We model the hierarchical labels as a composition of their tokens and use an efficient cross-attention mechanism to fuse the information with the term representations of the content. We also propose an adaptive in-batch hard negative sampling approach which samples better negatives as the training progresses. We demonstrate that the proposed approach \textit{TagRec++} outperforms existing state-of-the-art approaches on question datasets as measured by Recall@k. In addition, we demonstrate zero-shot capabilities of \textit{TagRec++} and ability to adapt to label changes.
翻译:在线学习系统以笔录、书本和问题的形式拥有多个数据储存库。为了便于查阅,这种系统根据明确界定的等级分类(主题-章节-主题)对内容进行分类。对等级标签输入的分类任务通常是一个平坦的多级分类问题。这种方法忽视了输入词和等级标签符号之间的语义关联。替代方法也因将叶级节点视为标签而出现阶级不平衡。为了解决问题,我们把任务设计成一个密集的检索问题,以检索每个内容的适当等级标签。我们处理分类问题。我们把等级标签作为标牌的构成进行模型,并使用高效的交叉注意机制将信息与内容的术语表达方式结合起来。我们还提议采用适应性的硬式负面抽样方法,在培训过程中进行更负面的取样。我们证明,拟议的办法\ textitit{TagRec ⁇ 超越了为每个内容取回适当等级标签的当前状态的分类标签。我们在本文中处理分类问题标签上采用的方法,通过“重新统计”来显示我们测量到“零位”的能力。