arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.2102cs.AI
收藏

层次多类分解及其在作者身份判定中的应用

Hierarchical Multiclass Decompositions with Application to Authorship Determination

Technion - Israel Institute of Technology(以色列理工学院);Babylon Ltd.(巴比伦有限公司)

Ran El-Yaniv, Noam Etzion-Rosenberg

摘要:

本文主要研究如何将多类分类问题分解为二元子问题。我们扩展已知的詹森-香农边界贝叶斯风险的二进制问题的层次多类问题,并使用这些边界开发一个启发式的程序,构建层次多类分解多项式。我们测试我们的方法,并将其与众所周知的“全对”分解进行比较。我们的测试是使用机器学习作者的新作者身份确定基准测试进行的。新方法始终优于所有对分解时,类的数量是小的,甚至在较大的多类问题。使用这两种方法,我们实现的分类精度,使用SVM在由高频单令牌和高频令牌对组成的特征集,似乎是非常高的作者确定的已知结果相比。

英文摘要:

This paper is mainly concerned with the question of how to decompose multiclass classification problems into binary subproblems. We extend known Jensen-Shannon bounds on the Bayes risk of binary problems to hierarchical multiclass problems and use these bounds to develop a heuristic procedure for constructing hierarchical multiclass decomposition for multinomials. We test our method and compare it to the well known "all-pairs" decomposition. Our tests are performed using a new authorship determination benchmark test of machine learning authors. The new method consistently outperforms the all-pairs decomposition when the number of classes is small and breaks even on larger multiclass problems. Using both methods, the classification accuracy we achieve, using an SVM over a feature set consisting of both high frequency single tokens and high frequency token-pairs, appears to be exceptionally high compared to known results in authorship determination.

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

↑