Efficient mining strategy for frequent serial episodes in temporal database

Kuo Yu Huang, Chia Hui Chang

研究成果: 書貢獻/報告類型會議論文篇章同行評審

摘要

Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive and fixed-time intervals in a sequence. Previous studies on serial episodes consider only frequent serial episodes in a sequence of events (called simple sequence). In real world, we may find a set of events at each time slot in terms of various intervals (called complex sequence). Mining frequent serial episodes in complex sequences has more extensive applications than that in simple sequences. In this paper, we discuss the problem on mining frequent serial episodes in a complex sequence. We extend previous algorithm MINEPI to MINEPI+ for serial episode mining from complex sequences. Furthermore, a memory-anchored algorithm called EMMA is introduced for the mining task.

原文???core.languages.en_GB???
主出版物標題Frontiers of WWW Research and Development - APWeb 2006 - 8th Asia-Pacific Web Conference, Proceedings
頁面824-829
頁數6
DOIs
出版狀態已出版 - 2006
事件8th Asia-Pacific Web Conference, APWeb 2006: Frontiers of WWW Research and Development - Harbin, China
持續時間: 16 1月 200618 1月 2006

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3841 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???8th Asia-Pacific Web Conference, APWeb 2006: Frontiers of WWW Research and Development
國家/地區China
城市Harbin
期間16/01/0618/01/06

指紋

深入研究「Efficient mining strategy for frequent serial episodes in temporal database」主題。共同形成了獨特的指紋。

引用此