arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.0546cs.AIcs.CLcs.IR
收藏

Kaggle LSHTC4获奖解决方案

Kaggle LSHTC4 Winning Solution

The University of Waikato(怀卡托大学);Aalto University(阿尔托大学);Huawei Noah’s Ark Lab(华为诺亚方舟实验室)

Antti Puurula, Jesse Read, Albert Bifet

摘要:

我们在2014年Kaggle大规模分层文本分类(LSHTC)竞赛中的获奖作品主要由扩展多项式朴素贝叶斯的稀疏生成模型的集合组成。基本分类器由分层平滑模型组成,该模型结合了文档,标签和层次级别的Multinomials,并使用TF-IDF和BM 25的变体进行特征预处理。通过不同类型的折叠和针对不同措施的随机搜索优化来引入额外的多样化。集成算法通过预测每个标签的文档来优化macroFscore,而不是通常的每个文档的标签预测。文档的分数是通过基分类器输出的加权投票来预测的,该基分类器输出具有加权线性堆叠的变体。每个标签的文档数量是使用标签先验和投票分数阈值来选择的。本文档描述了用于构建我们的解决方案的模型和软件。可以通过运行Kaggle包中包含的脚本来为我们的解决方案重现结果。一个包省略预先计算的结果文件也分发。所有代码都是开源的,在GNU GPL 2.0和GPL 3.0下发布,用于Weka和Meka依赖项。

英文摘要:

Our winning submission to the 2014 Kaggle competition for Large Scale Hierarchical Text Classification (LSHTC) consists mostly of an ensemble of sparse generative models extending Multinomial Naive Bayes. The base-classifiers consist of hierarchically smoothed models combining document, label, and hierarchy level Multinomials, with feature pre-processing using variants of TF-IDF and BM25. Additional diversification is introduced by different types of folds and random search optimization for different measures. The ensemble algorithm optimizes macroFscore by predicting the documents for each label, instead of the usual prediction of labels per document. Scores for documents are predicted by weighted voting of base-classifier outputs with a variant of Feature-Weighted Linear Stacking. The number of documents per label is chosen using label priors and thresholding of vote scores. This document describes the models and software used to build our solution. Reproducing the results for our solution can be done by running the scripts included in the Kaggle package. A package omitting precomputed result files is also distributed. All code is open source, released under GNU GPL 2.0, and GPL 3.0 for Weka and Meka dependencies.

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

↑