A Distributed Incremental Nearest Neighbor algorithm

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audio-visual search, based on similarity search on features, is significantly more expensive than searching for text. Moreover, the search exhibits linear scalability with respect to the data set size. In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DINN) for finding nearest neighbor in an incremental fashion over data distributed between nodes which are able to perform a local Incremental Nearest Neighbor (local-INN). We prove that our algorithm is optimal with respect to both number of involved nodes and number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN, was used for conducting an extensive experimental evaluation on a real-life dataset.

Cite

CITATION STYLE

APA

Falchi, F., Rabitti, F., Gennaro, C., & Zezula, P. (2007). A Distributed Incremental Nearest Neighbor algorithm. In ACM International Conference Proceeding Series (Vol. 06-08-June-2007). Association for Computing Machinery. https://doi.org/10.4108/infoscale.2007.196

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free