Recent Weighted Maximal Frequent Itemsets Mining

被引:0
|
作者
Subbulakshmi, B. [1 ]
Dharini, B. [1 ]
Deisy, C. [1 ]
机构
[1] Thiagarajar Coll Engn, Dept Comp Sci & Engn, Madurai, Tamil Nadu, India
关键词
frequeent itemsets; maximal itemsets; weighted itemsets; recency; ASSOCIATION RULES;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Frequent Itemsets Mining is a major task in data mining that is used for discovering the itemsets that occur frequently in a large database. But in real world, every item cannot be given same significance. And also items that are frequent very recently are very important ones to be mined. Frequent Itemsets Mining is incorporated with these two factors to give a new technique called Recent Weighted Frequent Itemsets Mining. Recent Weighted Frequent Itemsets Mining is an extension of Frequent Itemsets Mining task that is used for mining the frequent itemsets that satisfy the weight and recency constraints. This paper focuses on mining maximal recent weighted frequent Itemsets. Maximal Recent Weighted Frequent Itemsets is a compact representation of Recent Weighted Frequent Itemsets. This representation is very much useful when the database size is very large and memory is an issue. Number of maximal recent weighted frequent itemsets will be very much lesser than the number of recent weighted frequent itemsets for a given dataset. The time required for mining and memory required for storing is very less for maximal frequent itemsets when compared with frequent itemsets. The results of the proposed method show an improvement in the time complexity and also the memory space required for mining.
引用
收藏
页码:391 / 397
页数:7
相关论文
共 50 条
  • [1] RWFIM: Recent weighted-frequent itemsets mining
    Lin, Jerry Chun-Wei
    Gan, Wensheng
    Fournier-Viger, Philippe
    Hong, Tzung-Pei
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2015, 45 : 18 - 32
  • [2] Incremental mining of weighted maximal frequent itemsets from dynamic databases
    Yun, Unil
    Lee, Gangin
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 54 : 304 - 327
  • [3] Efficiently mining maximal frequent itemsets
    Gouda, K
    Zaki, MJ
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 163 - 170
  • [4] On Maximal Frequent Itemsets Mining with Constraints
    Jabbour, Said
    Mana, Fatima Ezzahra
    Dlala, Imen Ouled
    Raddaoui, Badran
    Sais, Lakhdar
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, 2018, 11008 : 554 - 569
  • [5] Mining maximal frequent itemsets with frequent pattern list
    Qian, Jin
    Ye, Feiyue
    [J]. FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 1, PROCEEDINGS, 2007, : 628 - 632
  • [6] Mining Frequent Weighted Closed Itemsets
    Bay Vo
    Nhu-Y Tran
    Duong-Ha Ngo
    [J]. ADVANCED COMPUTATIONAL METHODS FOR KNOWLEDGE ENGINEERING, 2013, 479 : 379 - 390
  • [7] Mining maximal frequent itemsets for intrusion detection
    Wang, H
    Li, QH
    Xiong, HY
    Jiang, SY
    [J]. GRID AND COOPERATIVE COMPUTING GCC 2004 WORKSHOPS, PROCEEDINGS, 2004, 3252 : 422 - 429
  • [8] A New Method for Mining Maximal Frequent Itemsets
    Nadimi-Shahraki, Mohammad
    Mustapha, Norwati
    Sulaiman, Md Nasir B.
    Mamat, Ali B.
    [J]. INTERNATIONAL SYMPOSIUM OF INFORMATION TECHNOLOGY 2008, VOLS 1-4, PROCEEDINGS: COGNITIVE INFORMATICS: BRIDGING NATURAL AND ARTIFICIAL KNOWLEDGE, 2008, : 1064 - 1067
  • [9] Fast algorithm for mining maximal frequent itemsets
    Ma, Lisheng
    Deng, Huiwen
    [J]. PROCEEDINGS OF THE FIRST INTERNATIONAL SYMPOSIUM ON DATA, PRIVACY, AND E-COMMERCE, 2007, : 86 - +
  • [10] Scalable algorithm for mining maximal frequent itemsets
    Li, QH
    Wang, H
    He, Y
    Jiang, SY
    [J]. 2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 143 - 146