El algoritmo PSO aplicado al problema de particionamiento de datos cuantitativos

Referencias

[1] Alias, M., Aziz, N., Aziz, K. & Mohemmed, A (2011). Particle swarm optimization for constrained and multiobjective problems: a brief review. Memorias de International Conference on Management and Artificial Intelligence, Bali, Indonesia, 6 (1), 146-150. [2] Babu, P. & Murty, N. (1994). Simulated annealing for selecting optimal initial seeds in the k-means algorithm. Indian Journal Pure and Applied Mathematics, 25(1-2), 85-94. [3] Bratton, D. & Kennedy, J. (2007). Defining a standard for particle swarm optimization. Memorias del IEES Swarm Intelligence Symposium, Hawaii, USA, 120-127. [4] Chavarría-Molina, J; Fallas-Monge. J. (2011) Movimiento de centroides y transferencias: alternativas para construir vecinos en sobrecalentamiento simulado. Tecnología en Marcha. Edición especial. Matemática Aplicada, Mayo, Costa Rica, 30(2), 65-77. [5] Chi-Yang, T. & I-Wei K., (2011). Particle swarm optimization with selective particle regeneration for data clustering. Elsevier. Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 320, Taiwan, ROC. [6] Eberhart,R. & Kennedy,J (1995). A New optimizer using particle swarm theory. Memorias de Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japón,39-43. [7] Hassan, R., Cohanim, B. & Weck, O. (2005). A comparison of particle swarm optimization and the genetic algorithm. En memorias de First AIAA Multidisciplinary Design Optimization Specialist Conference, Austin, Texas, USA, 1-13. [8] Kao, I.-W., Tsai, C.-Y., & Wang, Y.-C., (2007). An effective particle swarm optimization method for data clustering. In 2007 IEEE international conference on industrial engineering and engineering management, Singapore (pp. 548–552). [9] Kennedy, J. & Eberhart, R. (2001). Swarm Intelligence. Academic Press, San Diego, CA, USA. [10] Lima, J. & Baran, B. (2006). Optimización de enjambre de partículas aplicada al problema del Cajero viajante bi-objetivo. Revista Iberoamericana de Inteligencia Artificial, 10 (32), 67-76. [11] Ng, M. & Wong, J. (2002). Clustering categorical data sets using tabu search techniques. Elsevier Science Ltd on behalf of Pattern Recognition Society, 35 (12), 2783-2790. [12] Pacheco, A., Trejos, J., Piza, E. & Murillo, M. (2006). Evaluación de heurísticas de optimización combinatoria en clasificación por particiones. Revista Investigación Operacional, 27 (2), 124-128. [13] Sarkar, M. & Yegnanarayana, B. (1996). A clustering algorithmusing evolutionary programming. Memorias de la IEEE International Conference on Neural Network, Washington DC, USA, 1162-1167. [14] Sedighizadeh, D. & Masehian, E. (2009). Particle Swarm optimization methods, taxonomy and applications. International Journal of Computer Theory and Engineering, 1(5), 486-502. [15] Tan, L. (2015). A Clustering K-means Algorithm Based on Improved PSO Algorithm. Fifth International Conference on Communication Systems and Network Technologies, Gwalior, 940-944. doi:10.1109/CSNT.2015.223 [16] Trejos, J. & Murillo, A. (2004). Heuristics of Combinatorial Optimization and Applications to Data Analysis. Memorias de laI Summer School on Optimization and Numerical Analysis, Berlin, Alemania. [17] Tsai, CW., Huang, KW., Yang, CS. et al. Soft Comput (2015). A fast particle swarm optimization for clustering. 19: 321. doi:10.1007/s00500-014-1255-3. [18] University of Eastern Finland, School of Computing. (s.f.). Clustering datasets: Speech and Image Processing Unit [Repositorio de datos]. Recuperado desde http://cs.joensuu.fi/sipu/datasets/ [19] Xie, X., Zhang, W. & Yang, Z. (2002a). A Dissipative Particle Swarm Optimization. En Memorias de IEEE Congress on Evolutionary Computation, Honolulu,Hawai, USA, 2(1), 1456-1461. [20] Xie, X., Zhang, W. & Yang, Z. (2002b).Adaptive Particle Swarm Optimization on Individual Level. En Memorias de 6th International Conference on Signal Processing, Beijing, China, 2(1), 1215-1218.