| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Hsu,Jia-Lien;Liu,Chih-Chin;Chen,Arbee L.P. | en_US |
| dc.date (日期) | 2001-09 | en_US |
| dc.date.accessioned | 21-Aug-2014 15:09:05 (UTC+8) | - |
| dc.date.available | 21-Aug-2014 15:09:05 (UTC+8) | - |
| dc.date.issued (上傳時間) | 21-Aug-2014 15:09:05 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/69151 | - |
| dc.description.abstract (摘要) | 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 | en_US |
| dc.format.extent | 163 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | IEEE Transactions on Multimedia (EI,SCIE),3(3),311-325 | en_US |
| dc.title (題名) | Discovering nontrivial repeating patterns in music data | en_US |
| dc.type (資料類型) | article | en |
