True suffix tree approach for discovering non-trivial repeating patterns in a music object

  • Authors:

  • Yu-Lung Lo;Wen-Ling Lee;Lin-Huang Chang

  • Affiliations:

  • Department of Information Management, Chaoyang University of Technology, Taichung County, Taiwan 413;Department of Information Management, Chaoyang University of Technology, Taichung County, Taiwan 413;Department of Information Management, Chaoyang University of Technology, Taichung County, Taiwan 413

  • Venue:
  • Multimedia Tools and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

As the growing in Internet, database types and sizes are getting various and larger. The topic of finding out the significant information from a database at the shortest time is important. In the music databases, a repeating pattern is an important feature of music objects, which commonly used in analyzing the repeated part of music data and looking for themes. Most of the repeating patterns are key melodies or easy to familiarize and remember for people. Therefore, we can use the themes or the repeating patterns to construct indices that can speedup query execution for music retrievals. Nevertheless, non-trivial repeating patterns exclude those patterns, which are all contained in other longer patterns, such that they can reduce the redundancy of the repeating patterns and save the index space needed. Most of existing algorithms are time consuming for finding non-trivial repeating patterns in a music object. In this research, we aim to apply the true suffix tree approach to discover non-trivial repeating patterns for a music object, which can efficiently address the cost problems in processing time and memory space. In general case, our proposed scheme can extract non-trivial repeating patterns in a linear time.