An Algorithm of Mining Closed Frequent Itemsets

被引：0
|
作者：
Li, Haifeng [1 ]
机构：
[1] Cent Univ Finance & Econ Beijing, Sch Informat, Beijing 100081, Peoples R China
来源：
PROCEEDINGS OF THE 2015 5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND AUTOMATION ENGINEERING | 2016年 / 42卷
关键词：
Closed Frequent Itemset; Sampling; Data Mining;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Closed frequent itemset is a perfect representation of frequent itemset. This paper tries to find an efficient solution to mine the closed frequent itemsets over databases by sampling technique. We employ the SCFI tree to record the data synopsis of the frequent itemsets, and propose an efficient algorithm SCFI to maintain the SCFI. We conduct the experiments over standard benchmark datasets, and the results show that sampling is an effective method to improve the performance when mining the closed frequent itemsets.
引用
收藏
页码：95 / 98
页数：4
相关论文
共 50 条
  • [1] An Algorithm for Mining Frequent Closed Itemsets
    Zhang Tiejun
    Yang Junrui
    Wang Xiuqin
    2008 3RD INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEM AND KNOWLEDGE ENGINEERING, VOLS 1 AND 2, 2008, : 240 - +
  • [2] Research on an algorithm for mining frequent closed itemsets
    Zhu, Yuquan
    Song, Yuqing
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2007, 44 (07): : 1177 - 1183
  • [3] An efficient algorithm for mining frequent closed itemsets
    Fang, Gang
    Wu, Yue
    Li, Ming
    Chen, Jia
    Informatica (Slovenia), 2015, 39 (01): : 87 - 98
  • [4] An Efficient Algorithm for Mining Frequent Closed Itemsets
    Fang, Gang
    Wu, Yue
    Li, Ming
    Chen, Jia
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2015, 39 (01): : 87 - 98
  • [5] Improved algorithm for mining frequent closed itemsets
    Song, Wei
    Yang, Bingru
    Xu, Zhangyan
    Gao, Jing
    2008, Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China (45):
  • [6] New algorithm of mining frequent closed itemsets
    School of Computer and Information Technology, Liaoning Normal University, Dalian 116029, China
    J. Southeast Univ. Engl. Ed., 2008, 3 (335-338):
  • [7] An efficient algorithm for incrementally mining frequent closed itemsets
    Show-Jane Yen
    Yue-Shi Lee
    Chiu-Kuang Wang
    Applied Intelligence, 2014, 40 : 649 - 668
  • [8] NECLATCLOSED: A vertical algorithm for mining frequent closed itemsets
    Aryabarzan, Nader
    Minaei-Bidgoli, Behrouz
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 174
  • [9] 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
  • [10] An efficient algorithm for incrementally mining frequent closed itemsets
    Yen, Show-Jane
    Lee, Yue-Shi
    Wang, Chiu-Kuang
    APPLIED INTELLIGENCE, 2014, 40 (04) : 649 - 668
12345