An Efficient Approach for Updating the Structure for Mining Frequent Patterns

被引：0

作者：

Yen, Show-Jane ^{[1
]}

Lee, Yue-Shi ^{[1
]}

Gu, Jia-Yuan ^{[1
]}

机构：

[1] Ming Chuan Univ, Dept Comp Sci & Informat Engn, Gui Shan Dist 333, Taoyuan County, Taiwan

来源：

2012 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM) | 2012年

关键词：

Data mining; Frequent itemset; Transaction database; Tree structure;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Mining frequent patterns is to discover the groups of items appearing always together excess of a user specified threshold from a large transaction database. However, the transactions will grow rapidly, such that the frequent itemsets may be changed due to the addition of the new transactions. The users may eager for getting the latest frequent itemsets from the updated database as soon as possible in order to make the best decision. Therefore, it has become an important issue to propose an efficient method for finding the latest frequent itemsets when the transactions keep being added into the database. For the previous tree-based approaches, they have to re-scan the original database and generate a large tree structure. In this paper, we propose an efficient algorithm which only keeps frequent items in a condensed tree structure. When a set of new transactions is added into the database, our algorithm can efficiently update the tree structure without scanning the original database.

引用

页码：879 / 883

页数：5

共 50 条

[1] Mining frequent patterns with incremental updating frequent pattern tree
Zhu, Qunxiong
Lin, Xiaoyong
[J]. WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 5923 - +
[2] An integrated updating Algorithm for mining Maximal Frequent Patterns
Yang Jun-rui
Zhang Tie-jun
Liu Nan-yan
[J]. 2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11, 2008, : 2396 - 2400
[3] CanTree: A tree structure for efficient incremental mining of frequent patterns
Leung, CKS
Khan, QI
Hoque, T
[J]. Fifth IEEE International Conference on Data Mining, Proceedings, 2005, : 274 - 281
[4] An Efficient Count Based Transaction Reduction Approach For Mining Frequent Patterns
Vijayalakshmi, V.
Pethalakshmi, A.
[J]. GRAPH ALGORITHMS, HIGH PERFORMANCE IMPLEMENTATIONS AND ITS APPLICATIONS (ICGHIA 2014), 2015, 47 : 52 - 61
[5] An Efficient Approach for Mining Frequent Patterns over Uncertain Data Streams
Shajib, Md. Badi-Uz-Zaman
Samiullah, Md.
Ahmed, Chowdhury Farhan
Leung, Carson K.
Pazdor, Adam G. M.
[J]. 2016 IEEE 28TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2016), 2016, : 980 - 984
[6] An Efficient Approach for Mining Frequent Subgraphs
Alam, Tahira
Zahin, Sabit Anwar
Samiullah, Md.
Ahmed, Chowdhury Farhan
[J]. PATTERN RECOGNITION AND MACHINE INTELLIGENCE, PREMI 2017, 2017, 10597 : 486 - 492
[7] Efficient Mining of Frequent Patterns on Uncertain Graphs
Chen, Yifan
Zhao, Xiang
Lin, Xuemin
Wang, Yang
Guo, Deke
[J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2019, 31 (02) : 287 - 300
[8] Efficient indexing structures for mining frequent patterns
Bin, L
Ooi, BC
Tan, KL
[J]. 18TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2002, : 453 - 462
[9] A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives
Lee, Gangin
Yun, Unil
[J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2017, 68 : 89 - 110
[10] Efficient Updating of Discovered Patterns for Text Mining: A Survey
Radhakrishnan, Anisha
Kurian, Mathew
[J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2013, 13 (10): : 104 - 109

← 1 2 3 4 5 →