Abstract
In this paper, we propose a novel representation of sequences based on the structural information of the sequences. A sequence is represented by a set of rules, which are derived from its subsequences. There are two types of subsequences of interest. One is called frequent pattern, which is a subsequence appearing often enough in the sequence. The other is called correlative pattern, which is a subsequence composed of highly correlated elements. The rules derived from the frequent patterns are called frequent rules, while the ones derived from the correlative patterns are called correlative rules. By considering music objects as sequences, we represent each of them as a set of rules and design a similarity function for effective music retrieval. The experimental results show that our approaches outperform the approaches based on the Markov-model on the average precision.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence Databases. In: Proceedings of International Conference on Foundations of Data Organization and Algorithm, pp. 69–84 (1993)
Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proceedings of IEEE Conference on Data Engineering, pp. 3–14 (1995)
Chen, H.C., Chen, A.L.P.: A Music Recommendation System Based on Music Data Grouping and User Interests. In: Proceedings of ACM Conference on Information and Knowledge Management, pp. 231–238 (2001)
Chai, W., Vercoe, B.: Folk Music Classification Using Hidden Markov Models. In: Proceedings of International Conference on Artificial Intelligence (2001)
Guralnik, V., Karypis, G.: A Scalable Algorithm for Clustering Sequential Data. In: Proceedings of IEEE Conference on Data Mining, pp. 179–186 (2001)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)
Hsu, J.L., Liu, C.C., Chen, A.L.P.: Discovering Nontrivial Repeating Patterns in Music Data. IEEE Transactions on Multimedia 3(3), 311–325 (2001)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2001)
Huron, D.: The Melodic Arch in Western Folksongs. Computing in Musicology 10 (1995)
Kowalski, G.J., Maybury, M.T.: Information Storage and Retrieval Systems Theory and Implementation. Kluwer Publishers, Dordrecht (1997)
Lesh, N., Zaki, M.J., Ogihara, M.: Mining Features for Sequence Classification. In: Proceedings of ACM Conference on Knowledge Discovery and Data Mining, pp. 342–346 (1999)
Moshe, S.: Dynamic Programming. Marcel Dekker, New York (1992)
Manning, C.D., Schütze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (2001)
Morzy, T., Wojciechowski, M., Zakrzewicz, M.: Pattern-Oriented Hierarchical Clustering. In: Proceedings of Advances in Databases and Information Systems, pp. 179–190 (1999)
Pickens, J., Bello, J.P., Monti, G., Crawford, T., Dovey, M., Sandler, M., Byrd, D.: Polyphonic Score Retrieval Using Polyphonic Audio Queries: A Harmonic Modeling Approach. In: Proceedings of International Conference on Music Information Retrieval (2002)
Pickens, J., Crawford, T.: Harmonic Models for Polyphonic Music Retrieval. In: Proceedings of ACM Conference on Information and Knowledge Management, pp. 430–437 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, CH., Cho, CW., Wu, YH., Chen, A.L.P. (2004). A Novel Representation of Sequence Data Based on Structural Information for Effective Music Retrieval. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive