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 条
  • [41] Fine-Tuning Spectrum Based Fault Localisation with Frequent Method Item Sets
    Laghari, Gulsher
    Murgia, Alessandro
    Demeyer, Serge
    [J]. 2016 31ST IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE), 2016, : 274 - 285
  • [42] New algorithms for finding approximate frequent item sets
    Borgelt, Christian
    Braune, Christian
    Koetter, Tobias
    Gruen, Sonja
    [J]. SOFT COMPUTING, 2012, 16 (05) : 903 - 917
  • [43] New algorithms for finding approximate frequent item sets
    Christian Borgelt
    Christian Braune
    Tobias Kötter
    Sonja Grün
    [J]. Soft Computing, 2012, 16 : 903 - 917
  • [44] A tree projection algorithm for generation of frequent item sets
    Agarwal, RC
    Aggarwal, CC
    Prasad, VVV
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (03) : 350 - 371
  • [45] Finding Frequent Item Sets from Sparse Matrix
    Zheng Xiao-Yan
    Sun Ji-Zhou
    Zheng Xiao-Yan
    [J]. ICECT: 2009 INTERNATIONAL CONFERENCE ON ELECTRONIC COMPUTER TECHNOLOGY, PROCEEDINGS, 2009, : 615 - 619
  • [46] Cell assembly detection with frequent item set mining
    Christian Borgelt
    David Picado
    Denise Berger
    George Gerstein
    Sonja Grün
    [J]. BMC Neuroscience, 13 (Suppl 1)
  • [47] An efficient spatial high-utility occupancy frequent item mining algorithm for mission system integration architecture design using the MBSE method
    Dong X.
    Wang M.
    Liu Y.
    Xiao G.
    Huang D.
    Wang G.
    [J]. Aerospace Systems, 2022, 5 (3) : 377 - 392
  • [48] Finding neural assemblies with frequent item set mining
    Picado-Muino, David
    Borgelt, Christian
    Berger, Denise
    Gerstein, George
    Gruen, Sonja
    [J]. FRONTIERS IN NEUROINFORMATICS, 2013, 7
  • [49] Frequent Item Mining When Obtaining Support Is Costly
    Lin, Joe Wing-Ho
    Wong, Raymond Chi-Wing
    [J]. BIG DATA ANALYTICS AND KNOWLEDGE DISCOVERY, DAWAK 2019, 2019, 11708 : 37 - 56
  • [50] A Collaborative Approach of Frequent Item Set Mining: A Survey
    Shah, Arpan
    Patel, Pratik
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2015, 15 (11): : 49 - 52