2009 | OriginalPaper | Buchkapitel
A Fast Nearest Neighbor Method Using Empirical Marginal Distribution
verfasst von : Mineichi Kudo, Jun Toyama, Hideyuki Imai
Erschienen in: Knowledge-Based and Intelligent Information and Engineering Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Unfortunately there is no essentially faster algorithm than the brute-force algorithm for the nearest neighbor searching in high-dimensional space. The most promising way is to find an approximate nearest neighbor in high probability. This paper describes a novel algorithm that is practically faster than most of previous algorithms. Indeed, it runs in a sublinear order of the data size.