Neural Network Based Association Rule Mining from Uncertain Data

被引:2
作者
Mansha, Sameen [1 ]
Babar, Zaheer [1 ]
Kamiran, Faisal [1 ]
Karim, Asim [1 ,2 ]
机构
[1] Informat Technol Univ Punjab, Lahore, Pakistan
[2] Lahore Univ Management Sci, Lahore, Pakistan
来源
NEURAL INFORMATION PROCESSING, ICONIP 2016, PT IV | 2016年 / 9950卷
关键词
Frequent itemset mining; Uncertain data; Self organizing map; FREQUENT ITEMSETS; MAP;
D O I
10.1007/978-3-319-46681-1_16
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In data mining, the U-Apriori algorithm is typically used for Association Rule Mining (ARM) from uncertain data. However, it takes too much time in finding frequent itemsets from large datasets. This paper proposes a novel algorithm based on Self-Organizing Map (SOM) clustering for ARM from uncertain data. It supports the feasibility of neural network for generating frequent itemsets and association rules effectively. We take transactions in which itemsets are associated with probabilities of occurrence. Each transaction is converted to an input vector under a probabilistic framework. SOM is employed to train these input vectors and visualize the relationship between the items in a database. Distance map based on the weights of winning neurons and support count of items is used as a criteria to prune data space. As shown in our experiments, the proposed SOM is a promising alternative to typical mining algorithms for ARM from uncertain data.
引用
收藏
页码:129 / 136
页数:8
相关论文
共 50 条
[31]   Fast Algorithms for Frequent Itemset Mining from Uncertain Data [J].
Leung, Carson Kai-Sang ;
MacKinnon, Richard Kyle ;
Tanbeer, Syed K. .
2014 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2014, :893-898
[32]   Mining Weighted Frequent Patterns from Uncertain Data Streams [J].
Ovi, Jesan Ahammed ;
Ahmed, Chowdhury Farhan ;
Leung, Carson K. ;
Pazdor, Adam G. M. .
PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON UBIQUITOUS INFORMATION MANAGEMENT AND COMMUNICATION (IMCOM) 2019, 2019, 935 :917-936
[33]   Association Rule Mining with Differential Privacy [J].
Zhen, Hao ;
Chiou, Bo-Cheng ;
Tsou, Yao-Tung ;
Kuo, Sy-Yen ;
Wang, Pang-Chieh .
50TH ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS WORKSHOPS (DSN-W 2020), 2020, :47-54
[34]   Toward boosting distributed association rule mining by data de-clustering [J].
Tseng, Frank S. C. ;
Kuo, Yen-Hung ;
Huang, Yueh-Min .
INFORMATION SCIENCES, 2010, 180 (22) :4263-4289
[35]   SOTARM: Size of transaction-based association rule mining algorithm [J].
Pandian, Asha ;
Thaveethu, Jebarajan .
TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2017, 25 (01) :278-291
[36]   Stream mining on univariate uncertain data [J].
Liu, Ying-Ho .
APPLIED INTELLIGENCE, 2013, 39 (02) :315-344
[37]   Uncertain Frequent Itemsets Mining Algorithm on Data Streams with Constraints [J].
Yu, Qun ;
Tang, Ke-Ming ;
Tang, Shi-Xi ;
Lv, Xin .
INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2016, 2016, 9937 :192-201
[38]   Efficient mining algorithm of frequent itemsets for uncertain data streams [J].
Wang Qianqian ;
Liu Fang-ai .
PROCEEDINGS OF 2016 9TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 2, 2016, :443-446
[39]   Finding efficiencies in frequent pattern mining from big uncertain data [J].
Carson Kai-Sang Leung ;
Richard Kyle MacKinnon ;
Fan Jiang .
World Wide Web, 2017, 20 :571-594
[40]   Finding the Provenance of k-anonymous Data and Adding it to Association-rule Mining [J].
Liu Yilong ;
Liu Guohua .
PROCEEDINGS OF THE 2012 EIGHTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS 2012), 2012, :117-122