This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th International Conference on Data Engineering (ICDE'99)
Efficient Theme and Non-Trivial Repeating Pattern Discovering in Music Databases
Sydney, Australia
March 23-March 26
ISBN: 0-7695-0071-4
Chih-Chin Liu, National Tsing Hua University
Jia-Lien Hsu, National Tsing Hua University
Arbee L. P. Chen, National Tsing Hua University
In this paper, we propose an approach for fast discovering all non-trivial repeating patterns in music objects. A repeating pattern is a sequence of notes which appears more than once in a music object. The longest repeating patterns in music objects are typically their themes. The themes and other non-trivial repeating patterns are important music features which can be used for both content-based retrieval of music data and music data analysis. We present a data structure called RT-tree and its associated algorithms for fast extracting all non-trivial repeating patterns in a music object. Experiments are performed to compare with the related approaches. The results are further analyzed to show the efficiency and the effectiveness of our approach.
Citation:
Chih-Chin Liu, Jia-Lien Hsu, Arbee L. P. Chen, "Efficient Theme and Non-Trivial Repeating Pattern Discovering in Music Databases," icde, pp.14, 15th International Conference on Data Engineering (ICDE'99), 1999
Usage of this product signifies your acceptance of the Terms of Use.