Fuzzy Frequent Pattern Mining from Gene Expression Data using Dynamic Multi-Swarm Particle Swarm Optimization

被引:4
作者
Mishra, Shruti [1 ]
Mishra, Debahuti [1 ]
Satapathy, Sandeep Ku. [1 ]
机构
[1] Siksha O Anusandhan, Inst Tech Educ & Res, Bhubaneswar, Odisha, India
来源
2ND INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATION, CONTROL AND INFORMATION TECHNOLOGY (C3IT-2012) | 2012年 / 4卷
关键词
Frequent pattern mining; Fuzzy logic; Particle Swam Optimization; Dynamic Multi-Swarm- Particle Swarm Optimization; SEARCH;
D O I
10.1016/j.protcy.2012.05.130
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Frequent pattern mining is a basic problem as well as an important task in data mining and knowledge discovery. But however, frequent patterns in large scale datasets is an extremely time consuming task. So, in order to reduce the time the fuzzy concept was introduced in order to discretize the dataset in the range of 0 to 1. The Particle Swarm Optimizing (PSO) algorithm was basically developed from the social behavior of various animals likes bird flocking and fish schooling etc. In the existing versions of the local PSO algorithm with different neighborhood structures and the multi swarm PSOs, the swarms are predefined or dynamically adjusted according to the distance. Due to this the freedom of sub-swarms is limited. But in dynamic multi-swarm particle swarm optimizer (DMS-PSO) the neighborhood structure is dynamic and randomized. In this paper, a fuzzy data set has been used and various frequent pattern mining techniques like Apriori, Vertical data format and Frequent Pattern (FP) growth were implemented. Out of various frequent pattern mining techniques it was clear that FP growth method yields the better results on a fuzzy dataset. The frequent patterns obtained were considered as the set of initial population or particles. For the selection criteria, we have considered the mean squared residue (MSR) score rather using the threshold value. It has been observed that DMS-PSO based fuzzy FP growth technique finds the best individual frequent patterns as compared to the traditional PSO based fuzzy FP growth and also the runtime of the first was much better than the latter. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of C3IT
引用
收藏
页码:797 / 801
页数:5
相关论文
共 9 条
[1]  
[Anonymous], 2010, P IEEE C EV COMP CEC
[2]  
Davidon WC, 1989, VARIABLE METRIC METH
[3]  
Eberhart R., 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science (Cat. No.95TH8079), P39, DOI 10.1109/MHS.1995.494215
[4]   A RAPIDLY CONVERGENT DESCENT METHOD FOR MINIMIZATION [J].
FLETCHER, R ;
POWELL, MJD .
COMPUTER JOURNAL, 1963, 6 (02) :163-&
[5]   Wavelength detection in FBG sensor network using tree search DMS-PSO [J].
Liang, J. J. ;
Suganthan, P. N. ;
Chan, C. C. ;
Huang, V. L. .
IEEE PHOTONICS TECHNOLOGY LETTERS, 2006, 18 (9-12) :1305-1307
[6]  
Mishra S., 2011, 2011 2nd International Conference on Computer and Communication Technology, P15, DOI 10.1109/ICCCT.2011.6075204
[7]   INDUCTION OF FUZZY DECISION TREES [J].
YUAN, YF ;
SHAW, MJ .
FUZZY SETS AND SYSTEMS, 1995, 69 (02) :125-139
[8]   FUZZY SETS [J].
ZADEH, LA .
INFORMATION AND CONTROL, 1965, 8 (03) :338-&
[9]   Dynamic Multi-Swarm Particle Swarm Optimizer with Local Search for Large Scale Global Optimization [J].
Zhao, S. Z. ;
Liang, J. J. ;
Suganthan, P. N. ;
Tasgetiren, M. F. .
2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, :3845-+