Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 406047, 11 pages
http://dx.doi.org/10.1155/2013/406047
Research Article

Combinatorial Clustering Algorithm of Quantum-Behaved Particle Swarm Optimization and Cloud Model

1College of Business Administration, Hunan University, No. 11 Lushan South Road, Changsha 410082, China
2Liverpool Business School, Liverpool John Moores University, Redmonts Building, Brownlow Hill, Liverpool L3 5UX, UK

Received 14 April 2013; Revised 22 September 2013; Accepted 7 October 2013

Academic Editor: T. Warren Liao

Copyright © 2013 Mi-Yuan Shan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. K. Jain, M. N. Murty, and P. J. Flynn, “Data clustering: a review,” ACM Computing Surveys, vol. 31, no. 3, pp. 316–323, 1999. View at Google Scholar · View at Scopus
  2. S. S. Khan and A. Ahmad, “Cluster center initialization algorithm for K-means clustering,” Pattern Recognition Letters, vol. 25, no. 11, pp. 1293–1302, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. S. Kotsiantis and P. Pintelas, “Recent advances in clustering: a brief survey,” WSEAS Transactions on Information Science and Applications, vol. 1, no. 1, pp. 73–81, 2004. View at Google Scholar
  4. J.-S. Lee and S. Olafsson, “Data clustering by minimizing disconnectivity,” Information Sciences, vol. 181, no. 4, pp. 732–746, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. H. Alizadeh, B. Minaei-Bidgoli, and S. K. Amirgholipour, “A new method for improving the performance of k nearest neighbor using clustering technique,” Journal of Convergence Information Technology, vol. 4, no. 2, pp. 84–92, 2009. View at Google Scholar
  6. R. Xu and D. Wunsch II, “Survey of clustering algorithms,” IEEE Transactions on Neural Networks, vol. 16, no. 3, pp. 645–678, 2005. View at Publisher · View at Google Scholar · View at Scopus
  7. H. Frigui and R. Krishnapuram, “A robust competitive clustering algorithm with applications in computer vision,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 5, pp. 450–465, 1999. View at Publisher · View at Google Scholar · View at Scopus
  8. Y. Leung, J.-S. Zhang, and Z.-B. Xu, “Clustering by scale-space filtering,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 12, pp. 1396–1410, 2000. View at Publisher · View at Google Scholar · View at Scopus
  9. E. Forgy, “Cluster analysis of multivariate data: efficiency vs. interpretability of classification,” Biometrics, vol. 21, pp. 768–780, 1965. View at Google Scholar
  10. L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis, Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics, John Wiley & Sons, New York, NY, USA, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  11. I. Gath and A. B. Geva, “Unsupervised optimal fuzzy clustering,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 7, pp. 773–780, 1989. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Lorette, X. Descombes, and J. Zerubia, “Fully unsupervised fuzzy clustering with entropy criterion,” in International Conference on Pattern Recognition, vol. 3, pp. 3998–4001, 2000.
  13. K.-Y. Huang, “A synergistic automatic clustering technique (SYNETRACT) for multispectral image analysis,” Photogrammetric Engineering and Remote Sensing, vol. 68, no. 1, pp. 33–40, 2002. View at Google Scholar · View at Scopus
  14. G. H. Ball and D. J. Hall, “A clustering technique for summarizing multivariate data,” Behavioral Science, vol. 12, no. 2, pp. 153–155, 1967. View at Google Scholar · View at Scopus
  15. D. Pelleg and A. Moore, “X-means: extending K-means with efficient estimation of the number of clusters,” in Proceedings of the 17th International Conference on Machine Learning, pp. 727–734, Morgan Kaufmann, San Francisco, Calif, USA, 2000.
  16. G. Hamerly and C. Elkan, “Learning the K in K-means,” in Proceedings of 7th Annual Conference on Neural Information Processing Systems (NIPS '03), pp. 281–288, 2003.
  17. M. G. H. Omran, A. Salman, and A. P. Engelbrecht, “Dynamic clustering using particle swarm optimization with application in image segmentation,” Pattern Analysis and Applications, vol. 8, no. 4, pp. 332–344, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. S. Ouadfel, M. Batouche, and A. Taleb-Ahmed, “A new particle swarm optimization algorithm for dynamic image clustering,” in Proceedings of the 5th International Conference on Digital Information Management (ICDIM '10), pp. 546–551, July 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. C. S. Wallace and D. M. Boulton, “An information measure for classification,” Computer Journal, vol. 11, no. 2, pp. 185–194, 1968. View at Publisher · View at Google Scholar · View at Scopus
  20. P. N. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining, Pearson Education, 2006.
  21. J. Sander, M. Ester, H.-P. Kriegel, and X. Xu, “Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications,” Data Mining and Knowledge Discovery, vol. 2, no. 2, pp. 169–194, 1998. View at Google Scholar · View at Scopus
  22. Y. Shi and R. Eberhart, “Modified particle swarm optimizer,” in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC '98), pp. 69–73, IEEE Press, Piscataway, NJ, USA, May 1998. View at Scopus
  23. M. Clerc, “The swarm and the queen: towards a deterministic and adaptive particle swarm optimization,” in Proceedings of IEEE Congress on Evolutionary Computation (ICEC '99), pp. 1951–1957, Washington, DC, USA, 1999.
  24. F. Van den Bergh and A. P. Engelbrecht, “A new locally convergent particle swarm optimiser,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 3, pp. 94–99, October 2002. View at Scopus
  25. B. Zhao, C. X. Guo, B. R. Bai, and Y. J. Cao, “An improved particle swarm optimization algorithm for unit commitment,” International Journal of Electrical Power and Energy Systems, vol. 28, no. 7, pp. 482–490, 2006. View at Publisher · View at Google Scholar · View at Scopus
  26. M. S. Arumugam and M. V. C. Rao, “On the improved performances of the particle swarm optimization algorithms with adaptive parameters, cross-over operators and root mean square (RMS) variants for computing optimal control of a class of hybrid systems,” Applied Soft Computing Journal, vol. 8, no. 1, pp. 324–336, 2008. View at Publisher · View at Google Scholar · View at Scopus
  27. M. A. Montes de Oca, T. Stützle, M. Birattari, and M. Dorigo, “Frankenstein's PSO: a composite particle swarm optimization algorithm,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 5, pp. 1120–1132, 2009. View at Publisher · View at Google Scholar · View at Scopus
  28. J. Kennedy and R. C. Eberhart, “Discrete binary version of the particle swarm algorithm,” in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pp. 4104–4108, IEEE Service Center, Piscataway, NJ, USA, October 1997. View at Scopus
  29. L. Wang and J. Yu, “Fault feature selection based on modified binary PSO with mutation and its application in chemical process fault diagnosis,” in Proceedings of the 1st International Conference on Advances in Natural Computation (ICNC '05), vol. 3612 of Lecture Notes in Computer Science, pp. 832–840, Changsha, China, August 2005. View at Scopus
  30. L.-Y. Chuang, H.-W. Chang, C.-J. Tu, and C.-H. Yang, “Improved binary PSO for feature selection using gene expression data,” Computational Biology and Chemistry, vol. 32, no. 1, pp. 29–37, 2008. View at Publisher · View at Google Scholar · View at Scopus
  31. X. F. Xie, W. J. Zhang, and Z. L. Yang, “A dissipative particle swarm optimization,” in Proceedings of the IEEE Congress on Evolutionary Computing (CEC '02), pp. 1666–1670, Honolulu, Hawaii, USA, 2002.
  32. L. Wang, L. Zhang, and D.-Z. Zheng, “An effective hybrid genetic algorithm for flow shop scheduling with limited buffers,” Computers & Operations Research, vol. 33, no. 10, pp. 2960–2971, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  33. L. Nanni and A. Lumini, “Particle swarm optimization for prototype reduction,” Neurocomputing, vol. 72, no. 4-6, pp. 1092–1097, 2009. View at Publisher · View at Google Scholar · View at Scopus
  34. S. Kiranyaz, T. Ince, A. Yildirim, and M. Gabbouj, “Fractional particle swarm optimization in multidimensional search space,” IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 40, no. 2, pp. 298–319, 2010. View at Publisher · View at Google Scholar · View at Scopus
  35. S. Ouadfel, M. Batouche, and A. Taleb-Ahmed, “A new particle swarm optimization algorithm for dynamic image clustering,” in Proceedings of the 5th International Conference on Digital Information Management (ICDIM '10), pp. 546–551, July 2010. View at Publisher · View at Google Scholar · View at Scopus
  36. E. Martinez, M. M. Alvarez, and V. Trevino, “Compact cancer biomarkers discovery using a swarm intelligence feature selection algorithm,” Computational Biology and Chemistry, vol. 34, no. 4, pp. 244–250, 2010. View at Publisher · View at Google Scholar · View at Scopus
  37. Y.-T. Kao, E. Zahara, and I.-W. Kao, “A hybridized approach to data clustering,” Expert Systems with Applications, vol. 34, no. 3, pp. 1754–1762, 2008. View at Publisher · View at Google Scholar · View at Scopus
  38. R. J. Kuo, Y. J. Syu, Z.-Y. Chen, and F. C. Tien, “Integration of particle swarm optimization and genetic algorithm for dynamic clustering,” Information Sciences, vol. 195, pp. 124–140, 2012. View at Publisher · View at Google Scholar · View at Scopus
  39. H. Cheng, S. Yang, and J. Cao, “Dynamic genetic algorithms for the dynamic load balanced clustering problem in mobile ad hoc networks,” Expert Systems with Applications, vol. 40, no. 4, pp. 1381–1392, 2013. View at Google Scholar
  40. D. Chang, Y. Zhao, C. Zheng, and X. Zhang, “A genetic clustering algorithm using a message-based similarity measure,” Expert Systems with Applications, vol. 39, no. 2, pp. 2194–2202, 2012. View at Publisher · View at Google Scholar · View at Scopus