Luo, Yanmin and Furuse, Kazutaka and Chen, Hanxiong and Ohbo, Nobuo (2010) Finding Aggregate Nearest Neighbor Efficiently without Indexing. In: 2nd International ICST Conference on Scalable Information Systems.
![[thumbnail of 13980.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "13980.pdf")
PDF
13980.pdf
Download (46kB)
Abstract
Aggregate Nearest Neighbor Queries are much more complex than Nearest Neighbor queries, and pruning strategies are always utilized in ANN queries. Most of the pruning methods are based on the data index mechanisms, such as R-tree. But for the well-known curse of dimensionality, ANN search could be m
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 09:22 |
| Last Modified: | 18 Apr 2026 04:16 |
| URI: | http://eprints.eai.eu/id/eprint/5619 |
Actions (login required)
- View Item