Pivot-Based Distributed K-Nearest Neighbor Mining

Caitlin Kuhlman, Yizhou Yan, Lei Cao, Elke A. Rundensteiner

Abstract

k-nearest neighbor (kNN) search is a fundamental data mining task critical to many data analytics methods. Yet no effective techniques to date scale kNN search to large datasets. In this work we present PkNN, an exact distributed method that by leveraging modern distributed architectures for the first time scales kNN search to billion point datasets. The key to the PkNN strategy is a multi-round kNN search that exploits pivot-based data partitioning at each stage. This includes an outlier-driven partition adjustment mechanism that effectively minimizes data duplication and achieves a balanced workload across the compute cluster. Aggressive data-driven bounds along with a tiered support assignment strategy ensure correctness while limiting computation costs. Our experimental study on multi-dimensional real-world data demonstrates that PkNN achieves significant speedup over the state-of-the-art and scales effectively in data cardinality. Code and data related to this chapter are available at: http://solar-10.wpi.edu/cakuhlman/PkNN .
BibTeX
@inproceedings{kuhlman2017pivot,
  author = {Caitlin Kuhlman and Yizhou Yan and Lei Cao and Elke A. Rundensteiner},
  title = {{Pivot-Based Distributed K-Nearest Neighbor Mining}},
  booktitle = {ECML/PKDD},
  year = {2017},
  doi = {10.1007/978-3-319-71246-8\_51},
}

Loading related content...

Figure