Skip to main content

Efficient Feature Mining in Music Objects

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2113))

Abstract

This paper proposes novel strategies for efficiently extracting repeating patterns and frequent note sequences in music objects. Based on bit stream representation, the bit index sequences are designed for representing the whole note sequence of a music object with little space requirement. Besides, the proposed algorithm counts the repeating frequency of a pattern efficiently to rapidly extracting repeating patterns in a music object. Moreover, with the assist of appearing bit sequences, another algorithm is proposed for verifying the frequent note sequences in a set of music objects efficiently. Experimental results demonstrate that the performance of the proposed approach is more efficient than the related works.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules in Large Databases,” in Proc. 20th International Conference on Very Large Data Bases, 1994.

    Google Scholar 

  2. R. Agrawal and R. Srikant, “Mining Sequential Patterns,” in Proc. the IEEE International Conference on Data Engineering (ICDE), Taipei, Taiwan, 1995.

    Google Scholar 

  3. C. Bettini, S. Wang, S. Jajodia, and J.-L. Lin, “Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences,” IEEE Trans. on Knowledge and Data Eng., vol. 10,no. 2, 1998.

    Google Scholar 

  4. M.S. Chen, J. Han and P.S. Yu, “Data Mining: an Overview from a Database Perspective,” IEEE Trans. Knowledge and Data Eng., Vol. 8,No. 6, Dec.1996.

    Google Scholar 

  5. J.-L. Hsu, C.-C. Liu, and A.L.P Chen, “Efficient Repeating Pattern Finding in Music Databases,” in Proc. the 1998 ACM 7th International Conference on Information and Knowledge Management (CIKM’98), 1998.

    Google Scholar 

  6. Roberto J. and Bayardo Jr., “Efficiently Mining Long Patterns from Databases,” in Proc. ACM SIGMOD International Conference on Management of Data, 1998.

    Google Scholar 

  7. J.-L. Koh and W.D.C. Yu, “Efficient Repeating and Frequent Sequential Patterns Mining in Music Databases,” Technique report in Department of information and computer education, National Taiwan Normal University.

    Google Scholar 

  8. C.-C. Liu, J.-L. Hsu and A.L.P. Chen, “Efficient Theme and Non-Trivial Repeating Pattern Discovering in Music Databases,” in Proc. IEEE International Conference on Data Engineering, 1999.

    Google Scholar 

  9. K. Wang, “Discovering Patterns from Large and Dynamic Sequential Data,” Journal of Intelligent Information Systems (JIIS), Vol. 9,No. 1, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koh, JL., Yu, W.D.C. (2001). Efficient Feature Mining in Music Objects. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-44759-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42527-4

  • Online ISBN: 978-3-540-44759-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics