Mining frequent closed itemsets with one database scanning

被引：0
|
作者：
Qiu, Yong [1 ]
Lan, Yong-Jie [1 ]
机构：
[1] Shandong Inst Business & Technol, Sch Informat & Elect Engn, YanTai 264005, Peoples R China
来源：
PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2006年
关键词：
data mining; association rules; FP-tree; frequent itemsets;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Frequent closed itemsets mining has become an important alternative of association rule mining recently. CloSET+ is a efficient algorithm to find Frequent closed itemsets without candidate generation. However, CloSET+ must scan database two times. In order to enhance the efficiency of CloSET+ algorithms and reduce the I/O cost of database scanning in frequent closed itemsets mining, propose a novel algorithm called QCloSET+ which can mining Frequent closed itemsets with one database scanning.
引用
收藏
页码：1326 / +
页数：2
相关论文
共 50 条
  • [21] An algorithm for discovering the frequent closed itemsets in a large database
    Singh, Ningthoujam Gourakishwar
    Singh, Sanasam Ranbir
    Mahanta, Anjana K.
    Prasad, Bhanu
    JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2006, 18 (04) : 481 - 499
  • [22] Mining approximate closed frequent itemsets over stream
    Li, Haifeng
    Lu, Zongjian
    Chen, Hong
    PROCEEDINGS OF NINTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, 2008, : 405 - 410
  • [23] Frequent closed itemsets lattice used in data mining
    Cheng, ZH
    Jia, L
    Pei, RQ
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 1745 - 1748
  • [24] Fast Mining of Closed Frequent Itemsets in Data Streams
    Mao Yimin
    Chen Zhigang
    Liu Lixin
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY, PTS 1-4, 2013, 263-266 : 231 - +
  • [25] An Efficient Mining Model for Global Frequent Closed Itemsets
    Lin, Jianming
    Ju, Chunhua
    Liu, Dongsheng
    PROCEEDINGS OF THE SECOND INTERNATIONAL SYMPOSIUM ON ELECTRONIC COMMERCE AND SECURITY, VOL II, 2009, : 278 - 282
  • [26] Fast and memory efficient mining of frequent closed itemsets
    Lucchese, C
    Orlando, S
    Perego, R
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2006, 18 (01) : 21 - 36
  • [27] An efficient algorithm for incrementally mining frequent closed itemsets
    Show-Jane Yen
    Yue-Shi Lee
    Chiu-Kuang Wang
    Applied Intelligence, 2014, 40 : 649 - 668
  • [28] Mining frequent closed itemsets without candidate generation
    Chen, K
    PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, 2005, 3758 : 668 - 677
  • [29] NECLATCLOSED: A vertical algorithm for mining frequent closed itemsets
    Aryabarzan, Nader
    Minaei-Bidgoli, Behrouz
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 174
  • [30] An Optimization to CHARM Algorithm for Mining Frequent Closed Itemsets
    Ye, Xin
    Wei, Feng
    Jiang, Fan
    Cheng, Shaoyin
    CIT/IUCC/DASC/PICOM 2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY - UBIQUITOUS COMPUTING AND COMMUNICATIONS - DEPENDABLE, AUTONOMIC AND SECURE COMPUTING - PERVASIVE INTELLIGENCE AND COMPUTING, 2015, : 226 - 235
12345