An efficient algorithm for mining large item sets

被引:0
|
作者
Zheng, Hong-Zhen [1 ]
Chu, Dian-Hui [1 ]
Zhan, De-Chen [2 ]
机构
[1] Harbin Inst Technol, Coll Comp Sci & Technol, Weihai 264209, Peoples R China
[2] Harbin Inst Technol, Coll Comp Sci & Technol, Harbin, Heilongjiang, Peoples R China
关键词
data mining; association rules;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It propose Online Mining Algorithm ( OMA) which online discover large item sets. Without pre-setting a default threshold, the OMA algorithm achieves its efficiency and threshold-flexibility by calculating itemsets' counts. It is unnecessary and independent of the default threshold and can flexibly adapt to any user's input threshold. In addition, we propose Cluster-Based Association Rule Algorithm (CARA) creates cluster tables to aid discovery of large item sets. It only requires a single scan of the database, followed by contrasts with the partial cluster tables. It not only prunes considerable amounts of data reducing the time needed to perform data scans and requiring less contrast, but also ensures the correctness of the mined results. By using the CARA algorithm to create cluster tables in advance, each CPU can be utilized to process a cluster table; thus large item sets can be immediately mined even when the database is very large.
引用
收藏
页码:151 / +
页数:2
相关论文
共 50 条
  • [1] An Efficient Algorithm for Mining Large Item Sets
    Zheng, Hong-Zhen
    Chu, Dian-Hui
    Zhan, De-Chen
    Xu, Xiao-Fei
    [J]. FIFTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS, 2008, : 561 - 564
  • [2] Efficient Mining of Frequent Item Sets on Large Uncertain Databases
    Wang, Liang
    Cheung, David Wai-Lok
    Cheng, Reynold
    Lee, Sau Dan
    Yang, Xuan S.
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (12) : 2170 - 2183
  • [3] A vertical format algorithm for mining frequent item sets
    Guo Yi-ming
    Wang Zhi-jun
    [J]. 2ND IEEE INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER CONTROL (ICACC 2010), VOL. 4, 2010, : 11 - 13
  • [4] A new mining algorithm based on frequent item sets
    Wen Yun
    [J]. FIRST INTERNATIONAL WORKSHOP ON KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2007, : 410 - 413
  • [5] An efficient method for discovery of large item sets
    Deshpande, Deepa S.
    [J]. INTERNATIONAL JOURNAL OF DATA MINING MODELLING AND MANAGEMENT, 2016, 8 (04) : 303 - 314
  • [6] An efficient algorithm for mining high utility itemsets with negative item values in large databases
    Chu, Chun-Jung
    Tseng, Vincent S.
    Liang, Tyne
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2009, 215 (02) : 767 - 778
  • [7] Algorithm of Frequent Item Sets Mining Based on Index Table
    Zhang Lin
    Yao Nanzhen
    Zhang Jianli
    [J]. MECHATRONICS, ROBOTICS AND AUTOMATION, PTS 1-3, 2013, 373-375 : 1076 - +
  • [8] Design and Implementation of Improved Algorithm for Frequent Item Sets Mining
    Zhang Lin
    Zhang Jianli
    [J]. PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, : 1696 - 1698
  • [9] Parallel algorithm for mining frequent item sets based on Spark
    Mao Y.
    Wu B.
    Xu C.
    Zhang M.
    [J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2023, 29 (04): : 1267 - 1283
  • [10] Frequent Item Sets and Association Rules Mining Algorithm Based on Floyd Algorithm
    Zhang Lin
    Zhang Jianli
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (09) : 2574 - 2578