BriefGPT.xyz
Aug, 2014
条件概率树的估计分析与算法
Conditional Probability Tree Estimation Analysis and Algorithms
HTML
PDF
Alina Beygelzimer, John Langford, Yuri Lifshits, Gregory Sorkin, Alexander L. Strehl
TL;DR
本研究考虑在O(log n)时间内估计标签的条件概率。通过将此问题归约为树状结构中的一组二分类回归问题，分析了与树的深度成比例的代价上限，并提出了第一个可证明构建标签的对数深度树来解决此问题的在线算法，经实验证明适用于约106个标签的数据集。
Abstract
We consider the problem of estimating the
conditional probability
of a label in time O(log n), where n is the number of possible labels. We analyze a natural reduction of this problem to a set of
binary regression
→