Incremental mining of closed inter-transaction itemsets over data stream sliding windows
檔案
- 000289408600008.pdf (1.35 MB, Adobe PDF)
日期
2011-04-01
類型
系所
期刊名稱
JOURNAL OF INFORMATION SCIENCE
卷期與頁次
第 37 卷第 2 期,頁 208–220
ISSN
0165-5515
語言
英文
摘要
Mining inter-transaction association rules is one of the most interesting issues in data mining research. However, in a data stream environment the previous approaches are unable to find the result of the new-incoming data and the original database without re-computing the whole database. In this paper, we propose an incremental mining algorithm, called DSM-CITI (Data Stream Mining for Closed Inter-Transaction Itemsets), for discovering the set of all frequent inter-transaction itemsets from data streams. In the framework of DSM-CITI, a new in-memory summary data structure, ITP-tree, is developed to maintain frequent inter-transaction itemsets. Moreover, algorithm DSM-CITI is able to construct ITP-tree incrementally and uses the property to avoid unnecessary updates. Experimental studies show that the proposed algorithm is efficient and scalable for mining frequent inter-transaction itemsets over stream sliding windows.
關鍵詞
data miningdata streamsincremental miningstream sliding window miningfrequent inter-transaction itemsets所屬典藏
期刊論文引用此條目
Chiu, S.-C., Li, H.-F., Huang, J.-L., & You, H.-H. (2011). Incremental mining of closed inter-transaction itemsets over data stream sliding windows. JOURNAL OF INFORMATION SCIENCE, 37(2), 208–220. https://doi.org/10.1177/0165551511401539
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/9048