政大學術集成


請使用永久網址來引用或連結此文件: https://ah.nccu.edu.tw/handle/140.119/69151


題名: Discovering nontrivial repeating patterns in music data
作者: 陳良弼
Hsu,Jia-Lien;Liu,Chih-Chin;Chen,Arbee L.P.
貢獻者: 資科系
日期: 2001-09
上傳時間: 2014-08-21 15:09:05 (UTC+8)
摘要: A repeating pattern in music data is defined as a sequence of notes which appears more than once in a music object. The themes are a typical kind of repeating patterns. The themes and other nontrivial repeating patterns are important music features which can be used for both content-based retrieval of music data and music data analysis. In this paper, we propose two approaches for fast discovering nontrivial repeating patterns in music objects. In the first approach, we develop a data structure called correlative matrix and its associated algorithms for extracting the repeating patterns. In the second approach, we introduce a string-join operation and a data structure called RP-tree for the same purpose. Experiments are performed to compare these two approaches with others. The results are further analyzed to show the efficiency and the effectiveness of our approaches
關聯: IEEE Transactions on Multimedia (EI,SCIE),3(3),311-325
資料類型: article
顯示於類別:[資訊科學系] 期刊論文

文件中的檔案:

檔案 描述 大小格式瀏覽次數
index.html0KbHTML811檢視/開啟


在學術集成中所有的資料項目都受到原著作權保護.


社群 sharing