Research Online

Logo

Goldsmiths - University of London

Locality Sensitive Hashing for Large Music Databases

Casey, Michael A. and Slaney, M.. 2008. Locality Sensitive Hashing for Large Music Databases. Signal Processing Magazine, IEEE, 25(2), pp. 128-131. ISSN 1053-5888 [Article]

No full text available

Abstract or Description

This lecture note describes a technique known as locality-sensitive hashing (LSH) that allows one to quickly find similar entries in large databases. This approach belongs to a novel and interesting class of algorithms that are known as randomized algorithms. A randomized algorithm does not guarantee an exact answer but instead provides a high probability guarantee that it will return the correct answer or one close to it. By investing additional computational effort, the probability can be pushed as high as desired.

Item Type:

Article

Identification Number (DOI):

https://doi.org/10.1109/MSP.2007.914237

Departments, Centres and Research Units:

Computing

Dates:

DateEvent
April 2008Published

Item ID:

15149

Date Deposited:

01 Dec 2015 13:56

Last Modified:

20 Jun 2017 09:42

Peer Reviewed:

Yes, this version has been peer-reviewed.

URI:

http://research.gold.ac.uk/id/eprint/15149

Edit Record Edit Record (login required)