完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLi, HFen_US
dc.contributor.authorLee, SYen_US
dc.contributor.authorShan, MKen_US
dc.date.accessioned2014-12-08T15:25:56Z-
dc.date.available2014-12-08T15:25:56Z-
dc.date.issued2004en_US
dc.identifier.isbn0-7803-8603-5en_US
dc.identifier.urihttp://hdl.handle.net/11536/18385-
dc.description.abstractIn this paper, we study the problem of mining frequent closed structures in a continuous, infinite-sized, and fast changing music melody stream. By modeling a music melody as a sequence of chord-sets, we propose an efficient algorithm FCS-stream (Frequent Closed Structures of streaming melody sequences) for incremental mining of frequent closed structures in one scan of the continuous stream of chord-set sequences. An extended prefix-tree structure called TCS-tree (Temporal Closed Structure tree) is developed for storing compact, essential information about the frequent closed structures of the stream. Results from our theoretical analysis and experimental studies with synthetic data show that algorithm FCS-strearn satisfies the main performance requirements, namely, single-pass, bounded memory, and real-time, for data stream mining.en_US
dc.language.isoen_USen_US
dc.titleMining frequent closed structures in stremying melody sequencesen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2004 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXP (ICME), VOLS 1-3en_US
dc.citation.spage2031en_US
dc.citation.epage2034en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000225567800513-
顯示於類別:會議論文