Full metadata record
DC FieldValueLanguage
dc.contributor.authorChiu, Shih-Chuanen_US
dc.contributor.authorShan, Man-Kwanen_US
dc.contributor.authorHuang, Jiun-Longen_US
dc.contributor.authorLi, Hua-Fuen_US
dc.date.accessioned2014-12-08T15:19:39Z-
dc.date.available2014-12-08T15:19:39Z-
dc.date.issued2009en_US
dc.identifier.isbn978-1-4244-4290-4en_US
dc.identifier.issn1945-7871en_US
dc.identifier.urihttp://hdl.handle.net/11536/13967-
dc.description.abstractMining repeating patterns from music data is one of the most interesting issues of multimedia data mining. However, less work are proposed for mining polyphonic repeating patterns. Hence, two efficient algorithms, A-PRPD (priori-based Polyphonic Repeating Pattern Discovery) and T-PRPD (Tree-based Polyphonic Repeating Pattern Discovery), are proposed to discover polyphonic repeating patterns from music data. Furthermore, a bit-string method is developed for improving the efficiency of the proposed algorithms. Experimental results show that the proposed algorithms, A-PRPD and T-PRPD, are both effective and efficient methods for mining polyphonic repeating patterns from synthetic music data and real data.en_US
dc.language.isoen_USen_US
dc.subjectMultimedia data miningen_US
dc.subjectmusic data miningen_US
dc.subjectrepeating patternsen_US
dc.subjectpolyphonic repeating patternsen_US
dc.titleMINING POLYPHONIC REPEATING PATTERNS FROM MUSIC DATA USING BIT-STRING BASED APPROACHESen_US
dc.typeProceedings Paperen_US
dc.identifier.journalICME: 2009 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOLS 1-3en_US
dc.citation.spage1170en_US
dc.citation.epage1173en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000277357000288-
Appears in Collections:Conferences Paper