Method for Mining Frequent Item Sets Considering Average Utility

被引:6
|
作者
Agarwal, Reshu [1 ]
Gautam, Arti [2 ]
Saksena, Ayush Kumar [2 ]
Rai, Amrita [2 ]
Karatangi, Shylaja VinayKumar [2 ]
机构
[1] Amity Univ, Amity Inst Informat Technol, Noida, India
[2] GL Bajaj Inst Technol & Management, Greater Noida, India
关键词
Association rule mining; Data Mining; Average Utility; Frequent Item-sets; Two-phase Mining;
D O I
10.1109/ESCI50559.2021.9396947
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data mining is used to determine helpful data and information from large data bases for decision making in different fields. In today's scenario, mining high-utility item-sets (HUIs) has become a current investigation area. In traditional method HUIs are found on the basis individual utility of an item-set, which in turn is calculated as the totality of the utilities of individual items. But the problem is that the above way of finding HUIs does not consider length of item-set into consideration, while calculating HUIs. In real world situations, it is desirable to calculate average utility while considering both the length of item-sets and their utilities. This paper proposes an algorithm to find the high average-utility item-sets (HAUIs) seeing both parameters i.e. length of item-sets and their utilities. A numerical example is devised to explain the proposed approach. Experiments on real life databases shows that suggested model can proficiently discover the total set of HAUIs.
引用
收藏
页码:275 / 278
页数:4
相关论文
共 50 条
  • [31] Comparative Analysis of Genetic Based Approach and Apriori Algorithm for Mining Maximal Frequent Item Sets
    Kabir, Mir Md. Jahangir
    Xu, Shuxiang
    Kang, Byeong Ho
    Zhao, Zongyuan
    2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 39 - 45
  • [32] Study on Association Rules Mining Based on Searching Frequent Free Item Sets using Partition
    Zhang Hui
    Lu Yu
    Zhou Jinshu
    2009 ASIA-PACIFIC CONFERENCE ON INFORMATION PROCESSING (APCIP 2009), VOL 1, PROCEEDINGS, 2009, : 343 - +
  • [33] Parallel Frequent Item Set Mining with Selective Item Replication
    Ozkural, Eray
    Ucar, Bora
    Aykanat, Cevdet
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (10) : 1632 - 1640
  • [34] SIBA: A Fast Frequent Item Sets Mining Algorithm Based on Sampling and Improved Bat Algorithm
    Wei Ying
    Huang Jian
    Zhang Zhongjie
    Kong Jiangtao
    2015 CHINESE AUTOMATION CONGRESS (CAC), 2015, : 64 - 69
  • [35] Incremental Technique with Set of Frequent Word Item sets for Mining Large Indonesian Text Data
    Maylawati, Dian Sa'adillah
    Ramdhani, Muhammad Ali
    Rahman, Ali
    Darmalaksana, Wahyudin
    2017 5TH INTERNATIONAL CONFERENCE ON CYBER AND IT SERVICE MANAGEMENT (CITSM 2017), 2017, : 12 - 17
  • [36] Study on the Discovery Algorithm of the Frequent Item Sets
    Cheng, Huifeng
    Ma, Yanli
    Li, Fangping
    2009 INTERNATIONAL ASIA SYMPOSIUM ON INTELLIGENT INTERACTION AND AFFECTIVE COMPUTING, 2009, : 172 - +
  • [37] Effective utility mining with the measure of average utility
    Hong, Tzung-Pei
    Lee, Cho-Han
    Wang, Shyue-Liang
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (07) : 8259 - 8265
  • [38] Unique Constraint Frequent Item Set Mining
    Greeshma, L.
    Pradeepini, G.
    2016 IEEE 6TH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING (IACC), 2016, : 68 - 72
  • [39] Frequent Sets Mining for Problem Identification
    Encheva, Sylvia
    EDUTE 2009: PROCEEDINGS OF THE 5TH WSEAS/IASME INTERNATIONAL CONFERENCE ON EDUCATIONAL TECHNOLOGIES, 2009, : 33 - 37
  • [40] Mining Maximum frequent item sets over data streams using Transaction Sliding Window Techniques
    Dhull, Annuradha
    Yadav, Neeraj
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2014, 14 (02): : 85 - 90