Pivot-based Data Partitioning for Distributed k Nearest Neighbor Mining
This thesis addresses the need for a scalable distributed solution for k-nearest-neighbor (kNN) search, a fundamental data mining task. This unsupervised method poses particular challenges on shared-nothing distributed architectures, where global information about the dataset is not available to ind...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Digital WPI
2017
|
| Subjects: | |
| Online Access: | https://digitalcommons.wpi.edu/etd-theses/1214 |