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 条

[21] Parallelized Frequent Item Set Mining Using a Tall and Skinny Matrix
Janakiram, D. Pooja
2016 IEEE 16TH INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW), 2016, : 8 - 13
[22] Algorithm of Frequent Item Sets Mining Based on Index Table
Zhang Lin
Yao Nanzhen
Zhang Jianli
MECHATRONICS, ROBOTICS AND AUTOMATION, PTS 1-3, 2013, 373-375 : 1076 - +
[23] Design and Implementation of Improved Algorithm for Frequent Item Sets Mining
Zhang Lin
Zhang Jianli
PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, : 1696 - 1698
[24] Frequent Item Set Mining of Large Datasets Using CUDA Computing
Karthik, Peddi
Banu, J. Saira
SOFT COMPUTING FOR PROBLEM SOLVING, SOCPROS 2018, VOL 2, 2020, 1057 : 739 - 747
[25] Compressing Neural Networks by Applying Frequent Item-Set Mining
Dou, Zi-Yi
Huang, Shu-Jian
Su, Yi-Fan
ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING, PT II, 2017, 10614 : 696 - 704
[26] Data Elimination Based Technique for Mining Frequent Closed Item Set
Ahuja, Kamlesh
Jain, Sarika
PROCEEDINGS OF 2016 INTERNATIONAL CONFERENCE ON ICT IN BUSINESS INDUSTRY & GOVERNMENT (ICTBIG), 2016,
[27] Algorithm for mining frequent itemsets with item constraint based on partition
Chen, Hui-Ping
Zhu, Feng
Wang, Jian-Dong
Zhou, Xiao-Qin
Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2006, 28 (07): : 1082 - 1086
[28] Parallel algorithm for mining frequent item sets based on Spark
Mao Y.
Wu B.
Xu C.
Zhang M.
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2023, 29 (04): : 1267 - 1283
[29] AN EFFICIENT ALGORITHM FOR DETECTING OUTLIERS IN A DISTRIBUTED ENVIRONMENT USING MINIMAL IN-FREQUENT ITEM SET PATTERN MINING
Chandran, Chandra Ravi
Padmanabhan, Ajitha
IIOAB JOURNAL, 2016, 7 (09) : 22 - 25
[30] Frequent Item Sets and Association Rules Mining Algorithm Based on Floyd Algorithm
Zhang Lin
Zhang Jianli
JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (09) : 2574 - 2578

← 1 2 3 4 5 →