An Empirical Study of Density and Distribution Functions for Ant Swarm Optimized Rough Reducts

Ant Swarm Optimization refers to the hybridization of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) algorithms to enhance optimization performance. It is used in rough reducts calculation for identifying optimally significant attributes set. Coexistence, cooperation, and individual contribution to food searching by a particle (ant) as a swarm (colony) survival behavior, depict the common characteristics of both PSO and ACO algorithms. Ant colony approach in Ant Swarm algorithm generates local solutions which satisfy the Gaussian distribution for global optimization using PSO algorithm. The density and distribution functions are two common types of Gaussian distribution representation. However, the description and comparison of both functions are very limited. Hence, this paper compares the solution vector of ACO is represented by both density and distribution function to search for a better solution and to specify a probability functions for every particle (ant), and generate components of solution vector, which satisfy Gaussian distributions. To describe relative probability of different random variables, Probability Density Function (PDF) and the Cumulative Density Function (CDF) are capable to specify its own characterization of Gaussian distributions. The comparison is based on the experimental result to increase higher fitness value and gain better reducts.

[1]  K. Kadirgama,et al.  Response Ant Colony Optimization of End Milling Surface Roughness , 2010, Sensors.

[2]  Patrick Siarry,et al.  Particle swarm and ant colony algorithms hybridized for improved continuous optimization , 2007, Appl. Math. Comput..

[3]  Dongyi Ye,et al.  A New Fitness Function for Solving Minimum Attribute Reduction Problem , 2010, RSKT.

[4]  Mohammad Bagher Menhaj,et al.  Local Optima Avoidable Particle Swarm Optimization , 2009, 2009 IEEE Swarm Intelligence Symposium.

[5]  K.Y. Lee,et al.  Application of Particle Swarm Optimization to Economic Dispatch Problem: Advantages and Disadvantages , 2006, 2006 IEEE PES Power Systems Conference and Exposition.

[6]  Andrzej Skowron,et al.  Rudiments of rough sets , 2007, Inf. Sci..

[7]  Qin Yang,et al.  An Improved Particle Swarm Optimization , 2009, 2009 2nd International Conference on Biomedical Engineering and Informatics.

[8]  Zdzislaw Pawlak,et al.  Some Issues on Rough Sets , 2004, Trans. Rough Sets.

[9]  Z. Pawlak,et al.  Rough membership functions , 1994 .

[10]  Guoyan Meng,et al.  The Attribute Reduce Based on Rough Sets and SAT Algorithm , 2008, 2008 Second International Symposium on Intelligent Information Technology Application.

[11]  Gerald W. Kimble,et al.  Information and Computer Science , 1975 .

[12]  R. Eberhart,et al.  Fuzzy adaptive particle swarm optimization , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[13]  Ali Kaveh,et al.  A HYBRID PARTICLE SWARM AND ANT COLONY OPTIMIZATION FOR DESIGN OF TRUSS STRUCTURES , 2008 .

[14]  Xuren Wang,et al.  Rough Set Theory: Application in Electronic Commerce Data Mining , 2004, IEEE/WIC/ACM International Conference on Web Intelligence (WI'04).

[15]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[16]  Duoqian Miao,et al.  A rough set approach to feature selection based on ant colony optimization , 2010, Pattern Recognit. Lett..

[17]  Andrzej Skowron,et al.  Rough sets and Boolean reasoning , 2007, Inf. Sci..

[18]  Juan Barceló,et al.  Computational Intelligence in Archaeology , 2008 .

[19]  Jerzy W. Grzymala-Busse,et al.  Transactions on Rough Sets I , 2004, Lecture Notes in Computer Science.

[20]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).