完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLi, HFen_US
dc.contributor.authorLee, SYen_US
dc.date.accessioned2014-12-08T15:25:56Z-
dc.date.available2014-12-08T15:25:56Z-
dc.date.issued2004en_US
dc.identifier.isbn0-7695-2073-1en_US
dc.identifier.urihttp://hdl.handle.net/11536/18388-
dc.description.abstractIn this paper, we propose an online single-pass algorithm MFC-append (Mining Frequency Change patterns in append-only data streams) for online mining frequent frequency change items in continuous append-only data streams. An online space-efficient data structure called Change-Sketch is developed for providing fast response time to compute dynamic frequency changes between data streams. A modified approach MFC-dynamic (Mining frequency Change patterns in dynamic data streams) is also presented to mine frequency changes in dynamic data streams. The theoretic analyses show that our algorithms meet the major performance requirements of single-pass, bounded storage, and real time for streaming data mining.en_US
dc.language.isoen_USen_US
dc.titleSingle-pass algorithms for mining frequency change patterns with limited space in evolving append-only and dynamic transaction data streamsen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2004 IEEE INTERNATIONAL CONFERNECE ON E-TECHNOLOGY, E-COMMERE AND E-SERVICE, PROCEEDINGSen_US
dc.citation.spage215en_US
dc.citation.epage222en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000189506000030-
顯示於類別:會議論文