Approximate nearest-neighbour search with inverted signature slice lists
| Data(s) |
2015
|
|---|---|
| Resumo |
In this paper we present an original approach for finding approximate nearest neighbours in collections of locality-sensitive hashes. The paper demonstrates that this approach makes high-performance nearest-neighbour searching feasible on Web-scale collections and commodity hardware with minimal degradation in search quality. |
| Formato |
application/pdf |
| Identificador | |
| Publicador |
Springer International Publishing |
| Relação |
http://eprints.qut.edu.au/84126/7/84126.pdf DOI:10.1007/978-3-319-16354-3_16 Chappell, Timothy, Geva, Shlomo, & Zuccon, Guido (2015) Approximate nearest-neighbour search with inverted signature slice lists. Lecture Notes in Computer Science : Advances in Information Retrieval, 9022, pp. 147-158. |
| Direitos |
Copyright 2015 by Springer International Publishing Switzerland The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-16354-3_16 |
| Fonte |
School of Electrical Engineering & Computer Science; School of Information Systems; Science & Engineering Faculty |
| Palavras-Chave | #Locality-sensitive hashing #Hamming distance #Clustering |
| Tipo |
Journal Article |
