返回
CLASSIFICATION ALGORITHMS USING ADAPTIVE PARTITIONING
DOI:10.1214/14-AOS1234.png)
摘要
En 中文
Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be-viewed as generating a set approximation to the Bayes set and thus fall into the general category of set estimators. In contrast with the most studied tree-based algorithms, which utilize piecewise constant approximation on the generated partition [IEEE Trans. Inform. Theory 52 (2006) 1335-1353; Mach. Learn. 66 (2007) 209-242], we consider decorated trees, which allow us to derive higher order methods. Convergence rates for these methods are derived in terms the parameter alpha of margin conditions and a rate s of best approximation of the Bayes set by decorated adaptive partitions. They can also be expressed in terms of the Besov smoothness beta of the regression function that governs its approximability by piecewise polynomials on adaptive partition. The execution of the algorithms does not require knowledge of the smoothness or margin conditions. Besov smoothness conditions are weaker than the commonly used Holder conditions, which govern approximation by nonadaptive partitions, and therefore for a given regression function can result in a higher rate of convergence. This in turn mitigates the compatibility conflict between smoothness and margin parameters.
Keyword:
Binary classification
adaptive methods
set estimators
tree-based algorithms
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
引用论文
Allergens as trigger factors for allergic respiratory diseases and severe asthma during thunderstorms in pollen season
Aerobiologia
IF0
Discussion: Local rademacher complexities and oracle inequalities in risk minimization讨论: 风险最小化中的局部rademacher复杂性和oracle不等式
ANNALS OF STATISTICS
IF3.7

