Frequent item sets mining from high-dimensional dataset based on a novel binary particle swarm optimization

Abstract

A novel binary particle swarm optimization for frequent item sets mining from high-dimensional dataset (BPSO-HD) was proposed, where two improvements were joined. Firstly, the dimensionality reduction of initial particles was designed to ensure the reasonable initial fitness, and then, the dynamically dimensionality cutting of dataset was built to decrease the search space. Based on four high-dimensional datasets, BPSO-HD was compared with Apriori to test its reliability, and was compared with the ordinary BPSO and quantum swarm evolutionary (QSE) to prove its advantages. The experiments show that the results given by BPSO-HD is reliable and better than the results generated by BPSO and QSE.

Keywords

data mining / frequent item sets / particle swarm optimization

References

[1] HanJ-w, PeiJ, KamberMData mining: Concepts and techniques [M], 2011243-262

[2] LuoK, WangL-l, TongX-jiao. Mining association rules in incomplete information systems [J]. Journal of Central South University, 2008, 15: 733-737

[3] AlatasB, AkinE. Rough particle swarm optimization and its applications in data mining [J]. Soft Computation, 2008, 12: 1205-1218

[4] YkhlefM. A quantum swarm evolutionary algorithm for mining association rules in large databases [J]. Journal of King Saud University-Computer and Information Sciences, 2011, 23: 1-6

[5] AnkitaS, ShikhaA, JitendraA, SanjeevS. A review on application of particle swarm optimization in association rule mining [J]. Advances in Intelligent Systems and Computing, 2013, 199: 405-414

[6] XuY, ZengM-m, LiuQ-h, WangX-feng. A genetic algorithm based multilevel association rules mining for big datasets [J]. Mathematical Problems in Engineering, 2014867149

[7] BilalA, ErhanA. An efficient genetic algorithm for automated mining of both positive and negative quantitative association rules [J]. Soft Computation, 2006, 10: 230-237

[8] KuoR J, ShihC W. Association rule mining through the ant colony system for national health insurance research database in Taiwan [J]. Computers and Mathematics with Applications, 2007, 54: 1303-1308

[9] KennedyJ, EberhartR C, LozowskiA, CholewoT J, ZuradaJ M. Particle swarm optimization [C]. Proceedings of the IEEE International Conference on Neural Networks. Perth, Australia: IEEE press, 19952147-2156

[10] KuoR J, ChaoC M, ChiuY T. Application of particle swarm optimization to association rule mining [J]. Applied Soft Computing, 2011, 11: 326-336

[11] BohanecM, RajkovicV. DEX: An expert system shell for decision support [J]. Sistemica, 1990, 1(1): 145-157

[12] BadawyO M, SallamA A, HabibM I. Quantitative association rule mining using a hybrid PSO/ACO algorithm (PSO/ACO-AR)[C]. JAMEL F. Proceedings of Arab Conference on Information Technology. Hammamet, Tunisia: CCIS Press, 20081-9

[13] KabirM M J, XuS X, KangB H, ZhaoZ Y. Association rule mining for both frequent and infrequent items using particle swarm optimization algorithm [J]. International Journal on Computer Science and Engineering, 2014, 6(7): 221-231

[14] SalamA, KhayalM, SH. Mining top-k frequent patterns without minimum support threshold [J]. Knowledge Information System, 2012, 30: 57-86

[15] BanksA, VincentJ, AnyakohaC. A review of particle swarm optimization [J]. Nat Computation, 2007, 6: 467-484

[16] PoliR, KennedyJ, BlackwellT. Particle swarm optimization an overview [J]. Swarm Intelligent, 2007, 1: 33-57

[17] KennedyJ, EberhartR C. A discrete binary version of the particle swarm algorithm [C]. JAMES M T. Proceedings of the Conference on Systems, Man, and Cybernetics. Florida, USA: IEEE Press, 19974104-4108

[18] ClercM. Discrete particle swarm optimization, illustrated by the traveling salesman problem [J]. Studies in Fuzziness & Soft Computing, 2004, 47(1): 219-239

[19] MirjaliliS, LewisA. S-shaped versus V-shaped transfer functions for binary particle swarm optimization [J]. Swarm and Evolutionary Computation, 2013, 9: 1-14

[20] MirjaliliS, MirjaliliS M, YangX S. Binary bat algorithm [J]. Neural Computation and Application, 2014, 25(3): 663-681