SaM: A Split and Merge Algorithm for Fuzzy Frequent Item Set Mining

被引:0
|
作者
Borgelt, Christian [1 ]
Wang, Xiaomeng [2 ]
机构
[1] European Ctr Soft Comp, C Gonzalo Gutierrez Quiros S-N, Mieres 33600, Spain
[2] Otto von Guericke Univ, D-39106 Magdeburg, Germany
来源
PROCEEDINGS OF THE JOINT 2009 INTERNATIONAL FUZZY SYSTEMS ASSOCIATION WORLD CONGRESS AND 2009 EUROPEAN SOCIETY OF FUZZY LOGIC AND TECHNOLOGY CONFERENCE | 2009年
关键词
data mining; frequent item set mining; fuzzy frequent item set; fault tolerant data mining;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not only render it easy to implement, but also convenient to execute on external storage. Furthermore, it can easily be extended to allow for "fuzzy" frequent item set mining in the sense that missing items can be inserted into transactions with a user-specified penalty. In order to demonstrate its performance, we report experiments comparing it with the "fuzzy" frequent item set mining version of RElim (an algorithm we suggested in an earlier paper [15] and improved in the meantime).
引用
收藏
页码:968 / 973
页数:6
相关论文
共 50 条
  • [31] An Algorithm of Fast Mining Frequent Neighboring Class Set
    Fang, Gang
    Ying, Hong
    Xiong, Jiang
    INTELLIGENT COMPUTING AND INFORMATION SCIENCE, PT I, 2011, 134 (0I): : 290 - 295
  • [32] An Algorithm of Alternately Mining Frequent Neighboring Class Set
    Fang, Gang
    ADVANCES IN SWARM INTELLIGENCE, PT 2, PROCEEDINGS, 2010, 6146 : 588 - 593
  • [33] Distributed Frequent Item Mining
    Zhang, Yu
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY, PTS 1-4, 2013, 263-266 : 1202 - 1207
  • [34] Frequent item set mining for sequential data: Synchrony in neuronal spike trains
    Muino, David Picado
    Borgelt, Christian
    INTELLIGENT DATA ANALYSIS, 2014, 18 (06) : 997 - 1012
  • [35] Statistical evaluation of synchronous spike patterns extracted by frequent item set mining
    Torre, Emiliano
    Picado-Muino, David
    Denker, Michael
    Borgelt, Christian
    Gruen, Sonja
    FRONTIERS IN COMPUTATIONAL NEUROSCIENCE, 2013, 7
  • [36] FIMSIM: Discovering Communities by Frequent Item-Set Mining and Similarity Search
    Peschel, Jakub
    Batko, Michal
    Valcik, Jakub
    Sedmidubsky, Jan
    Zezula, Pavel
    SIMILARITY SEARCH AND APPLICATIONS, SISAP 2021, 2021, 13058 : 372 - 383
  • [37] Collaborative privacy preserving frequent item set mining in vertically partitioned databases
    Gudes, E
    Rozenberg, B
    DATA AND APPLICATIONS SECURITY XVII: STATUS AND PROSPECTS, 2004, 142 : 91 - 104
  • [38] Survey on Frequent Item-Set Mining Approaches in Market Basket Analysis
    Maske, Anisha
    Joglekar, Bela
    2018 FOURTH INTERNATIONAL CONFERENCE ON COMPUTING COMMUNICATION CONTROL AND AUTOMATION (ICCUBEA), 2018,
  • [39] Fuzzy split and merge for shadow detection
    Sasi, Remya K.
    Govindan, V. K.
    EGYPTIAN INFORMATICS JOURNAL, 2015, 16 (01) : 29 - 35
  • [40] Efficient algorithm for mining approximate frequent item over data streams
    Wang, Wei-Ping
    Li, Jian-Zhong
    Zhang, Dong-Dong
    Guo, Long-Jiang
    Ruan Jian Xue Bao/Journal of Software, 2007, 18 (04): : 884 - 892