Large-scale music similarity search with spatial trees

Proceedings of the 12th International Society for Music Information Retrieval Conference, ISMIR 2011

Volumn , Issue , 2011, Pages 55-60

  Mcfee, Brian ^a   Lanckriet, Gert ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT-BASED; HIGH DIMENSIONAL DATA; HIGH DIMENSIONAL SPACES; KD-TREE; LARGE DATABASE; MUSIC INFORMATION RETRIEVAL; MUSIC SIMILARITY; NEAREST NEIGHBORS; SIMILARITY SEARCH; SPATIAL PARTITIONING;

FORESTRY; QUERY PROCESSING;

INFORMATION RETRIEVAL;

DATA; EXPERIMENTATION; INFORMATION RETRIEVAL; SET; STRUCTURES;

EID: 84873572318     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. J.L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18:509-517, Sep. 1975.
2. Thierry Bertin-Mahieux, Daniel P.W. Ellis, Brian Whitman, and Paul Lamere. The million song dataset. In Proceedings of the 12th International Conference on Music Information Retrieval (ISMIR 2011), 2011.
3. Léon Bottou and Yoshua Bengio. Convergence properties of the kmeans algorithm. In Advances in Neural Information Processing Systems, volume 7. MIT Press, Denver, 1995.
4. Rui Cai, Chao Zhang, Lei Zhang, and Wei-Ying Ma. Scalable music recommendation by search. In International Conference on Multimedia, pages 1065-1074, 2007.
5. Lawrence Cayton. Fast nearest neighbor retrieval for bregman divergences. In International Conference on Machine Learning, pages 112-119, 2008.
6. O. Celma. Music Recommendation and Discovery in the Long Tail. Springer, 2010.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 3rd edition, 2009.
8. Sanjoy Dasgupta and Yoav Freund. Random projection trees and low dimensional manifolds. In ACM Symposium on Theory of Computing, pages 537-546, 2008.
9. Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the twentieth annual symposium on Computational geometry, SCG '04, pages 253-262, New York, NY, USA, 2004. ACM.
10. Christos Faloutsos and King-Ip Lin. Fastmap: a fast algorithm for indexing, data-mining and visualization. In Proceedings of ACM SIGMOD, pages 163-174, 1995.
11. Tony Jebara, Risi Kondor, and Andrew Howard. Probability product kernels. JMLR, 5:819-844, December 2004.
12. J.H. Kim, B. Tomasik, and D. Turnbull. Using artist similarity to propagate semantic information. In ISMIR, 2009.
13. Ting Liu, Andrew W. Moore, Alexander Gray, and Ke Yang. An investigation of practical approximate nearest neighbor algorithms. In NIPS, pages 825-832. 2005.
14. B. Logan. Music recommendation from song sets. In International Symposium on Music Information Retrieval, 2004.
15. B. McFee, L. Barrington, and G.R.G. Lanckriet. Learning content similarity for music recommendation, 2011. http://arxiv.org/1105.2344.
16. J. Reiss, J.J. Aucouturier, and M. Sandler. Efficient multidimensional searching routines for music information retrieval. In ISMIR, 2001.
17. Dominik Schnitzer, Arthur Flexer, and Gerhard Widmer. A filter-and-refine indexing method for fast similarity search in millions of music tracks. In ISMIR, 2009.
18. M. Slaney, K. Weinberger, and W. White. Learning a metric for music similarity. In ISMIR, pages 313-318, September 2008.
19. J.K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. 40(4):175-179, 1991.
20. Nakul Verma, Samory Kpotufe, and Sanjoy Dasgupta. Which spatial partition trees are adaptive to intrinsic dimension? In Uncertainty in Artificial Intelligence, pages 565-574, 2009.