Abstract
Cluster analysis is one of the important research contents in data mining. The basic Particle Swarm Optimization algorithm (PSO) can be combined with the traditional clustering algorithm to achieve clustering analysis. Aiming at the disadvantages of the basic particle swarm optimization algorithm is easy to fall into local extremum, the search accuracy is not high, and the traditional K-means and FCM clustering algorithm are affected by the initial clustering center. This paper proposes a new particle swarm clustering algorithm based on tree structure and neighborhood (TPSO), which designs the structure of the particle group as a tree structure, uses the breadth of traversal, increases the global search ability of the particle, and joins the neighborhood operation to let the particle close to the neighborhood optimal particles and accelerate the convergence speed of the algorithm. Our experiments using Iris, Wine, Seed, Breast-w4 group of UCI public data sets show that the accuracy obtained by the TPSO algorithm implementing the proposed K-means and FCM is statistically significantly higher than the accuracy of the other clustering algorithms, such as K-means algorithm, fuzzy C-means algorithm, the basic particle swarm optimization combined with traditional clustering algorithm, etc., Comparison experiments also indicate that the TPSO algorithm can significantly improve the clustering performance of PSO.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Han, J.W., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Elsevier, Singapore (2012)
Raftery, A.E., Dean, N.: Variable selection for model-based clustering. J. Am. Stat. Assoc. 101(473), 168–178 (2017)
Budzik, J., Bradshaw, S., Fu, X.B., et al.: Clustering for opportunistic communication. In: Proceedings of WWW, pp. 726–735. ACM Press (2016)
Guha, S., Mishra, N.: Clustering data streams. In: Garofalakis, M., Gehrke, J., Rastogi, R. (eds.) Data Stream Management. DSA, pp. 169–187. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-540-28608-0_8
Wang, S., Wang, D., Caoyuan, L.I., Yan, L.I., Ding, G.: Clustering by fast search and find of density peaks with data field. Chin. J. Electron. 25(3), 397–402 (2016)
Chi, Y., Song, X., Zhou, D., Hino, K., Tseng, B.L., et al.: Evolutionary spectral clustering by incorporating temporal smoothness. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, California, USA, August, pp. 153–162. DBLP (2017)
Du, W.B., Ying, W., Yan, G., Zhu, Y.B., Cao, X.B.: Heterogeneous strategy particle swarm optimization. IEEE Trans. Circ. Syst. II Exp. Briefs 64(4), 467–471 (2017)
Kennedy, J., Mendes, R.: Neighborhood topologies in fully-informed and best-of-neighborhood particle swarms. In: IEEE International Workshop on Soft Computing in Industrial Applications, vol. 36, pp. 45–50. IEEE (2003)
Bandyopadhyay, S., Maulik, U.: Genetic clustering for automatic evolution of clusters and application to image classification. Pattern Recogn. 35(6), 1197–1208 (2002)
Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. Wiley, Hoboken (2009)
Kao, Y., Lee, S.Y.: Combining K-means and particle swarm optimization for dynamic data clustering problems. In: IEEE International Conference on Intelligent Computing and Intelligent Systems, pp. 757–761 (2009)
Vimali, J.S., Taj, Z.S.: FCM based CF: an efficient approach for consolidating big data applications. In: International Conference on Innovation Information in Computing Technologies, pp. 1–7. IEEE (2016)
Kalaiselvi, T., Sriramakrishnan, P., Nirmala, J.: An investigation on suitable distance measure to FCM method for brain tissue segmentation. In: Computational Methods, Communication Techniques and Informatics (2017)
Ashraf, E., Mahmood, K., Ahmed, T., Ahmed, S.: Value based PSO test case prioritization algorithm. Int. J. Adv. Comput. Sci. Appl. 8(1), 389–394 (2017)
Jin, Y.X., Shi, Z.B.: An improved algorithm of quantum particle swarm optimization. J. Softw. 9(11), 2789–2795 (2014)
Asuncion, A., Newman, D.J.: UCI machine learning repository. School of Information and Computer Science, University of California, Irvine (2007). http://www.ics.uci.edu/~mlearn/mlrepository.html
Acknowledgements
This work was partially supported by the Guangdong Provincial Science and Technology Program (Grant Nos. 2017A020224004 and 2016A020212020), the National Natural Science Foundation of China (Grant Nos. 61573157 and 61703170), the Guangdong Provincial Natural Science Foundation Project (Grant Nos. 2015A030313413 and 2016A030313389). The authors also gratefully acknowledge the reviewers for their helpful comments and suggestions that helped to improve the presentation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Yang, L., Zhang, W., Lai, Z., Cheng, Z. (2018). A Particle Swarm Clustering Algorithm Based on Tree Structure and Neighborhood. In: Li, K., Li, W., Chen, Z., Liu, Y. (eds) Computational Intelligence and Intelligent Systems. ISICA 2017. Communications in Computer and Information Science, vol 874. Springer, Singapore. https://doi.org/10.1007/978-981-13-1651-7_6
Download citation
DOI: https://doi.org/10.1007/978-981-13-1651-7_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1650-0
Online ISBN: 978-981-13-1651-7
eBook Packages: Computer ScienceComputer Science (R0)