低成本、低错误分类器的随时归纳:一种基于采样的方法
Anytime Induction of Low-cost, Low-error Classifiers: a Sampling-based Approach
摘要:
机器学习技术在为具有非均匀测试和误分类成本的复杂现实世界应用产生广泛的分类器中越来越流行。这些应用程序的复杂性不断增加,对学习和分类过程中的资源管理提出了真正的挑战。在这项工作中,我们介绍ACT(随时成本敏感的树学习器),一种新的框架,在这样复杂的环境中运行。ACT是一种随时算法,它允许增加学习时间以降低分类成本。它自上而下地构建一棵树,并利用额外的时间资源来获得对不同候选拆分的效用的更好估计。使用抽样技术,ACT近似每个候选分割下的子树的成本,并倾向于具有最小成本的子树。作为一种随机算法,ACT预计能够摆脱局部最小值,而贪婪方法可能会陷入局部最小值。在各种数据集上进行了实验,将ACT与最先进的成本敏感树学习器进行比较。结果表明,对于大多数域ACT产生显着成本较低的树。ACT也表现出良好的随时行为,收益递减。
英文摘要:
Machine learning techniques are gaining prevalence in the production of a wide range of classifiers for complex real-world applications with nonuniform testing and misclassification costs. The increasing complexity of these applications poses a real challenge to resource management during learning and classification. In this work we introduce ACT (anytime cost-sensitive tree learner), a novel framework for operating in such complex environments. ACT is an anytime algorithm that allows learning time to be increased in return for lower classification costs. It builds a tree top-down and exploits additional time resources to obtain better estimations for the utility of the different candidate splits. Using sampling techniques, ACT approximates the cost of the subtree under each candidate split and favors the one with a minimal cost. As a stochastic algorithm, ACT is expected to be able to escape local minima, into which greedy methods may be trapped. Experiments with a variety of datasets were conducted to compare ACT to the state-of-the-art cost-sensitive tree learners. The results show that for the majority of domains ACT produces significantly less costly trees. ACT also exhibits good anytime behavior with diminishing returns.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。