完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Li, HF | en_US |
dc.contributor.author | Lee, SY | en_US |
dc.contributor.author | Shan, MK | en_US |
dc.date.accessioned | 2014-12-08T15:25:56Z | - |
dc.date.available | 2014-12-08T15:25:56Z | - |
dc.date.issued | 2004 | en_US |
dc.identifier.isbn | 0-7803-8603-5 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/18385 | - |
dc.description.abstract | In 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.iso | en_US | en_US |
dc.title | Mining frequent closed structures in stremying melody sequences | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | 2004 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXP (ICME), VOLS 1-3 | en_US |
dc.citation.spage | 2031 | en_US |
dc.citation.epage | 2034 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000225567800513 | - |
顯示於類別: | 會議論文 |