Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Survey on Content-Based Retrieval for Multimedia Databases
IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Pitch Tracking and Melody Slope Matching for Song Retrieval
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
A simple algorithm for finding frequent elements in streams and bags
ACM Transactions on Database Systems (TODS)
Discovering nontrivial repeating patterns in music data
IEEE Transactions on Multimedia
Approximate mining of maximal frequent itemsets in data streams with different window models
Expert Systems with Applications: An International Journal
Mining top-k Hot Melody Structures over online music query streams
Pattern Recognition Letters
Pattern discovery and change detection of online music query streams
Multimedia Tools and Applications
Incremental mining of closed inter-transaction itemsets over data stream sliding windows
Journal of Information Science
Hi-index | 0.10 |
In this paper, we address the problem of online mining maximal frequent structures (Type I &II melody structures) in unbounded, continuous landmark melody streams. An efficient algorithm, called MMS"L"M"S (Maximal Melody Structures of Landmark Melody Streams), is developed for online incremental mining of maximal frequent melody substructures in one scan of the continuous melody streams. In MMS"L"M"S, a space-efficient scheme, called CMB (Chord-set Memory Border), is proposed to constrain the upper-bound of space requirement of maximal frequent melody structures in such a streaming environment. Theoretical analysis and experimental study show that our algorithm is efficient and scalable for mining the set of all maximal melody structures in a landmark melody stream.