By Topic

Efficiently mining frequent patterns in recent music query streams

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hua-Fu Li ; Department of Computer Science, Kainan University, Taoyuan, Taiwan ; Ming-Ho Hsiao ; Hsuan-Sheng Chen

Mining frequent melody structures from music data is one of the most important issues in multimedia data mining. In this paper, we proposed an efficient online algorithm, called BVMDS (bit-vector based mining of data streams), to mine all frequent temporal patterns over sliding windows of music melody sequence streams. An effective bit-sequence representation is used in BVMDS to reduce the time and memory needed to slide the windows. An effective list structure is used to overcome the performance bottleneck of previous work, FTP-stream. Experiments show that the BVMDS algorithm outperforms FTP-stream algorithm, and just scans the streaming data once.

Published in:

2008 IEEE International Conference on Multimedia and Expo

Date of Conference:

June 23 2008-April 26 2008