메뉴 건너뛰기




Volumn , Issue , 2006, Pages 412-420

Exploring composite acoustic features for efficient music similarity query

Author keywords

CF tree; KNN; Music; Similarity query

Indexed keywords

ACOUSTIC FEATURES; MUSICAL FEATURES; SIMILARITY QUERY;

EID: 34547156519     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1180639.1180725     Document Type: Conference Paper
Times cited : (5)

References (23)
  • 1
    • 0033897520 scopus 로고    scopus 로고
    • Independent quantization: An index compression technique for high-dimensional data spaces
    • S. Berchtold, C. Bohm, H.P. Kriegel, J. Sander, and H. V. Jagadish. Independent quantization: An index compression technique for high-dimensional data spaces. In Proc 16th ICDE Conference, pages 577-588. 2000.
    • (2000) Proc 16th ICDE Conference , pp. 577-588
    • Berchtold, S.1    Bohm, C.2    Kriegel, H.P.3    Sander, J.4    Jagadish, H.V.5
  • 3
    • 0038670812 scopus 로고    scopus 로고
    • Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
    • C. Bohm, S. Berchtold, and D. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 2001.
    • (2001) ACM Computing Surveys
    • Bohm, C.1    Berchtold, S.2    Keim, D.3
  • 4
    • 0036497405 scopus 로고    scopus 로고
    • Problems of music information retrieval in the real word
    • D. Byrd and T. Crawford. Problems of music information retrieval in the real word. In Information Processing and Management, pages 249-272, 2001.
    • (2001) Information Processing and Management , pp. 249-272
    • Byrd, D.1    Crawford, T.2
  • 6
    • 0005287692 scopus 로고    scopus 로고
    • Local dimensionality reduction: A new approach to indexing high dimensional spaces
    • K. Chakrabarti and S. Mehrotra. Local dimensionality reduction: A new approach to indexing high dimensional spaces. In Proc VLDB, pages 89-100, 2000.
    • (2000) Proc VLDB , pp. 89-100
    • Chakrabarti, K.1    Mehrotra, S.2
  • 7
    • 70350388446 scopus 로고    scopus 로고
    • M-tree: An efficient access method for similarity search in metric spaces
    • P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Proc. 24th VLDB Conference, pages 194-205, 1997.
    • (1997) Proc. 24th VLDB Conference , pp. 194-205
    • Ciaccia, P.1    Patella, M.2    Zezula, P.3
  • 8
    • 29244463778 scopus 로고    scopus 로고
    • Adaptive quantization of the high-dimensional data for efficient knn processing
    • B. Cui, J. Hu, H. T. Shen, and C. Yu. Adaptive quantization of the high-dimensional data for efficient knn processing. In Proc 9th DASFAA Conference, 2004.
    • (2004) Proc 9th DASFAA Conference
    • Cui, B.1    Hu, J.2    Shen, H.T.3    Yu, C.4
  • 9
    • 1142267339 scopus 로고    scopus 로고
    • Contorting high dimensional data for efficient main memory processing
    • B. Cui, B. C. Ooi, J. W. Su, and K. L. Tan. Contorting high dimensional data for efficient main memory processing. In Proc ACM SIGMOD, pages 479-490, 2003.
    • (2003) Proc ACM SIGMOD , pp. 479-490
    • Cui, B.1    Ooi, B.C.2    Su, J.W.3    Tan, K.L.4
  • 14
    • 1542439119 scopus 로고    scopus 로고
    • A comparative study on content-based music genre classification
    • T. Li, M. Ogihara, and Q. Li. A comparative study on content-based music genre classification. In Proc. ACM SIGIR Conference, pages 282-289, 2003.
    • (2003) Proc. ACM SIGIR Conference , pp. 282-289
    • Li, T.1    Ogihara, M.2    Li, Q.3
  • 15
    • 77950833323 scopus 로고    scopus 로고
    • Efficient k-nn search in polyphonic music databases using a lower bounding mechanism
    • N. Liu, Y. Wu, and A. Chen. Efficient k-nn search in polyphonic music databases using a lower bounding mechanism. In Proc Multimedia Information Retrieval, pages 163-170, 2003.
    • (2003) Proc Multimedia Information Retrieval , pp. 163-170
    • Liu, N.1    Wu, Y.2    Chen, A.3
  • 17
    • 34547191940 scopus 로고    scopus 로고
    • Addressing the same but different - different but similar problem in automatic music classification
    • U. Nam and J. Berger. Addressing the same but different - different but similar problem in automatic music classification. In Proc. Multimedia Information Retrieval, 2001.
    • (2001) Proc. Multimedia Information Retrieval
    • Nam, U.1    Berger, J.2
  • 19
    • 18744365794 scopus 로고    scopus 로고
    • Integrating hetegrogeneous features for efficient content based music retrieval
    • J. Shen, J. Shepherd, and A. H. Ngu. Integrating hetegrogeneous features for efficient content based music retrieval. In Proc. 13th CIKM Conference, 2004.
    • (2004) Proc. 13th CIKM Conference
    • Shen, J.1    Shepherd, J.2    Ngu, A.H.3
  • 22
    • 0000681228 scopus 로고    scopus 로고
    • A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
    • R. Weber, H. J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc 24th VLDB Conference, pages 194-205, 1998.
    • (1998) Proc 24th VLDB Conference , pp. 194-205
    • Weber, R.1    Schek, H.J.2    Blott, S.3
  • 23
    • 84944319598 scopus 로고    scopus 로고
    • Indexing the distance: An efficient method to knn processing
    • C. Yu, B. C. Ooi, K. L. Tan, and H. V. Jagadish. Indexing the distance: An efficient method to knn processing. In Proc. 27th VLDB Conference, pages 421-430, 2001.
    • (2001) Proc. 27th VLDB Conference , pp. 421-430
    • Yu, C.1    Ooi, B.C.2    Tan, K.L.3    Jagadish, H.V.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.