Association rule mining using hybrid GA-PSO for multi-objective optimisation

被引:0
作者
Agarwal, Aashna [1 ]
Nanavati, Nirali [2 ]
机构
[1] SVNIT, Comp Engn Dept, Surat, India
[2] SCET, Comp Engn Dept, Surat, India
来源
2016 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMPUTING RESEARCH | 2016年
关键词
Association Rule Mining; Multi-Objective Optimization; Pareto optimality; Hybridisation; Genetic Algorithm; Particle Swarm Optimisation; Hybrid NSGA-II - MOPSO; ALGORITHMS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Association Rule Mining ( ARM), a Data Mining process, extracts hidden strong relationships among a large set of the correlated data. With the burgeoning advancement and application of Association Rule Mining in diverse fields ranging from the web usage mining to medical diagnosis and business intelligence to geographical information systems, the decision-making in ARM involves a multi-objective perspective to obtain an interesting and accurate rule set. By considering the Pareto optimality, an optimal trade-off is established between the conflicting and incommensurate performance parameters comprehensibility, interestingness and confidence of the mined rules. Both, Genetic Algorithm (GA) and Particle Swarm Optimisation (PSO), being population-based stochastic search method, have found their strong base in mining association rules. We propose an association rule mining scheme using our proposed multi-objective hybridisation of GA-PSO algorithm. The primary advantage of the proposed algorithm is that the hybridisation of multiple objective-GA with multi objective-PSO balances the exploration and exploitation tasks, resulting in valuable extraction of accurate and interpretable mined rules. Evaluating this hybrid model on Bakery dataset shows that with generation of comprehensible, interesting and reliable association rules, the model also converges four times faster than mono-objective hybridisation.
引用
收藏
页码:241 / 247
页数:7
相关论文
共 35 条
[1]  
Abraham A, 2004, ADV INFORM KNOWL PRO, P1
[2]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[3]  
Anand Rajul, 2009, NAT BIOL INSP COMP 2
[4]  
[Anonymous], 2006, Int J Comput Intell Res, DOI DOI 10.5019/J.IJCIR.2006.68
[5]  
[Anonymous], 2002, EVOLUTIONARY ALGORIT
[6]  
[Anonymous], 1994, P 20 INT C VER LARG
[7]  
[Anonymous], 2003, Advances in evolutionary computing
[8]  
Coello CAC, 2004, IEEE T EVOLUT COMPUT, V8, P256, DOI [10.1109/TEVC.2004.826067, 10.1109/tevc.2004.826067]
[9]  
Coello Carlos A. Coello, 2002, EV COMP 2002 CEC 02, V2
[10]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197