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 条
[41]   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
[42]   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
[43]   Finding efficiencies in frequent pattern mining from big uncertain data [J].
Leung, Carson Kai-Sang ;
MacKinnon, Richard Kyle ;
Jiang, Fan .
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2017, 20 (03) :571-594
[44]   Reducing the Search Space for Big Data Mining for Interesting Patterns from Uncertain Data [J].
Leung, Carson Kai-Sang ;
MacKinnon, Richard Kyle ;
Jiang, Fan .
2014 IEEE INTERNATIONAL CONGRESS ON BIG DATA (BIGDATA CONGRESS), 2014, :315-322
[45]   Association rule mining activity : A general formalism [J].
Ananthanarayana, VS ;
Subramanian, DK ;
Murty, MN .
CCCT 2003, VOL 3, PROCEEDINGS, 2003, :173-178
[46]   Relevant Association Rule Mining from Medical Dataset Using New Irrelevant Rule Elimination Technique [J].
Rameshkumar, K. ;
Sambath, M. ;
Ravi, S. .
2013 INTERNATIONAL CONFERENCE ON INFORMATION COMMUNICATION AND EMBEDDED SYSTEMS (ICICES), 2013, :300-304
[47]   New method for association rule mining based on granular computing and equivalence class [J].
Shen Ya-lan ;
Wang Xiang-dong ;
Wang Xiao-feng .
PROCEEDINGS OF 2006 CHINESE CONTROL AND DECISION CONFERENCE, 2006, :764-+
[48]   Improved Bisector Pruning for Uncertain Data Mining [J].
Lukic, Ivica ;
Kohler, Mirko ;
Slavek, Ninoslav .
PROCEEDINGS OF THE ITI 2012 34TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES (ITI), 2012, :355-360
[49]   Frequent Itemsets Mining on Weighted Uncertain Data [J].
Alharbi, Manal ;
Pathak, Sudipta ;
Rajasekaran, Sanguthevar .
2014 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY (ISSPIT), 2014, :201-206
[50]   Efficient Probabilistic Frequent Itemset Mining in Big Sparse Uncertain Data [J].
Xu, Jing ;
Li, Ning ;
Mao, Xiao-Jiao ;
Yang, Yu-Bin .
PRICAI 2014: TRENDS IN ARTIFICIAL INTELLIGENCE, 2014, 8862 :235-247