Online Mining of Recent Music Query Streams

Mining multimedia data is one of the most important issues in data mining. In this paper, we propose an online one-pass algorithm to mine the set of frequent temporal patterns in online music query streams with a sliding window. An effective bit-sequence representation is used to reduce the processing time and memory needed to slide the windows. Experiments show that the proposed algorithm only needs a half of memory requirement of original music query data, and just scans the data once

[1]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[2]  Shonali Krishnaswamy,et al.  Mining data streams: a review , 2005, SGMD.

[3]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[4]  Atsuo Yoshitaka,et al.  A Survey on Content-Based Retrieval for Multimedia Databases , 1999, IEEE Trans. Knowl. Data Eng..

[5]  Suh-Yin Lee,et al.  Online mining maximal frequent structures in continuous landmark melody streams , 2005, Pattern Recognit. Lett..

[6]  Jennifer Widom,et al.  Models and issues in data stream systems , 2002, PODS.

[7]  Vladimir D. Gusev,et al.  The Search for Adaptations in Song Melodies , 1997 .

[8]  Arbee L. P. Chen,et al.  Discovering nontrivial repeating patterns in music data , 2001, IEEE Trans. Multim..

[9]  Man-Kwan Shan,et al.  Music style mining and classification by melody , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[10]  Suh-Yin Lee,et al.  Mining frequent closed structures in streaming melody sequences , 2004, 2004 IEEE International Conference on Multimedia and Expo (ICME) (IEEE Cat. No.04TH8763).