TDUP: an approach to incremental mining of frequent itemsets with three-way-decision pattern updating

被引:29
|
作者
Li, Yao [1 ]
Zhang, Zhi-Heng [1 ]
Chen, Wen-Bin [1 ]
Min, Fan [1 ]
机构
[1] Southwest Petr Univ, Sch Comp Sci, Chengdu 610500, Peoples R China
基金
中国国家自然科学基金;
关键词
Frequent itemsets; Incremental mining; Synchronization mechanisms; Three-way decision; THEORETIC ROUGH SET; DECISION; RULES;
D O I
10.1007/s13042-015-0337-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Finding an efficient approach to incrementally update and maintain frequent itemsets is an important aspect of data mining. Earlier incremental algorithms focused on reducing the number of scans of the original database while it is updated. However, they still required the database to be rescanned in some situations. Here we propose a three-way decision update pattern approach (TDUP) along with a synchronization mechanism for this issue. With two support-based measures, all possible itemsets are divided into positive, boundary, and negative regions. TDUP efficiently updates frequent itemsets online, while the synchronization mechanism is periodically triggered to recompute the itemsets offline. The operation of the mechanism based on appropriate settings of two support-based measures is examined through experiments. Results from three real-world data sets show that the proposed approach is efficient and reliable.
引用
收藏
页码:441 / 453
页数:13
相关论文
共 50 条
  • [31] Mining itemsets - an approach to longitudinal and incremental association rule mining
    Mooney, C
    Roddick, JF
    [J]. DATA MINING III, 2002, 6 : 93 - 102
  • [32] An Approach for Incremental Frequent Pattern Mining Using Modified Apriori Algorithm
    Thomas, Harsha Sarah
    Victor, Nancy
    [J]. RESEARCH JOURNAL OF PHARMACEUTICAL BIOLOGICAL AND CHEMICAL SCIENCES, 2016, 7 (06): : 1049 - 1055
  • [33] Incremental mining of weighted maximal frequent itemsets from dynamic databases
    Yun, Unil
    Lee, Gangin
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 54 : 304 - 327
  • [34] An efficient maximal frequent itemsets mining algorithm - Based on frequent pattern tree
    Xue, XR
    Wang, GY
    Wu, Y
    Yang, SX
    [J]. DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2005, 1 : 176 - 181
  • [35] An efficient approach to mining frequent itemsets on data streams
    Ansari, Sara
    Sadreddini, Mohammad Hadi
    [J]. World Academy of Science, Engineering and Technology, 2009, 37 : 489 - 495
  • [36] Cluster Based Partition Approach for Mining Frequent Itemsets
    Tiwari, Akhilesh
    Gupta, Rajendra K.
    Agrawal, Dev Prakash
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2009, 9 (06): : 191 - 199
  • [37] Improvements in the data partitioning approach for frequent itemsets mining
    Nguyen, SN
    Orlowska, ME
    [J]. KNOWLEDGE DISCOVERY IN DATABASES: PKDD 2005, 2005, 3721 : 625 - 633
  • [38] Mining maximal frequent itemsets by a boolean based approach
    Salleb, A
    Maazouzi, Z
    Vrain, C
    [J]. ECAI 2002: 15TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2002, 77 : 385 - 389
  • [39] Association Rule Mining: A Graph Based Approach for Mining Frequent Itemsets
    Tiwari, Vivek
    Tiwari, Vipin
    Gupta, Shailendra
    Tiwari, Renu
    [J]. 2010 INTERNATIONAL CONFERENCE ON NETWORKING AND INFORMATION TECHNOLOGY (ICNIT 2010), 2010, : 309 - 313
  • [40] An Incremental Closed Frequent Itemsets Mining Algorithm Based on Shadow Prefix Tree
    Li, Yun
    Xu, Jie
    Zhang, Xiaobing
    Li, Chen
    Zhang, Yingjuan
    [J]. 2013 10TH WEB INFORMATION SYSTEM AND APPLICATION CONFERENCE (WISA 2013), 2013, : 440 - 445