Talk
in
Workshop: Nearest Neighbors for Modern Applications with Massive Data: An Age-old Solution with New Challenges
The Boundary Forest Algorithm
Jonathan Yedidia
[
Abstract
]
2017 Talk
Abstract:
I explain the Boundary Forest algorithm, a simple, fast, and incremental online algorithm that can be used in both supervised and unsupervised settings, for classification, regression, or retrieval problems. As a classification algorithm, its generalization performance is at least as good as K-nearest-neighbors, while being able to respond to queries very quickly. It maintains trees of examples that let it train and respond to test queries in a time logarithmic with the number of stored examples, which is typically very much less than the number of training examples.
Live content is unavailable. Log in and register to view live content