Abstract
The technique of distributing a set of natural entities into groups of related objects is called clustering. Trying to find a good search platform for data mining has incrementally become a key problem as most conventional search methodologies are still unable to contribute to the improvement of knowledge discovery. Spiral optimization (SO) seems to be an accurate functioning algorithm that uses natural processes including the spiralling pattern and pressurized to treasure an optimal result in a reasonable period of time. A novel SO is introduced in this paper to tackle the clustering dilemma. With the exception of the actual SO, that recursively spins the objects across the self-righteous centre, the developed system divides the population into many subgroups to maximize searching heterogeneity and thereby boost the result of cluster analysis. The procedure of k-means has also been utilized to improve the usefulness of the anticipated algorithm. To assess the proposed method’s accuracy, we introduce it to the problem of clustering and measure the findings through the optimization using spiral strategy and clustering using k-means algorithm. The outcomes illustrate that the suggested procedure is very optimistic.
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
Aggarwal CC, Han J, Wang J, Yu PS (2004) A framework for projected clustering of high dimensional datastreams. In: Proceedings of the thirtieth international conference on very large data bases, vol 30, p 863
Agrawal R, Gehrke JE, Gunopulos D, Raghavan P (1999) Automatic subspace clustering of high dimensional data fordata mining applications. Google Patents
Tamura K, Yasuda K (2011) Spiral multipoint search for global optimization. In: International conference on machine learning and applications, vol 1, pp 470–475
Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Erciyes University, Technical Report
Narayana GS, Vasumathi D (2016) Clustering for high dimensional categorical data based on text similarity. In: Proceedings of the 2nd international conference on communication and information processing (ICCIP-2016), pp 17–21. ISBN: 978-1-4503-4819-5
Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 60–68
Yang X-S (2009) Firefly algorithms for multimodal optimization. In: Watanabe O, Zeugmann T (eds) SAGA 2009, vol 5792. LNCS. Springer, Heidelberg, pp 169–178
Tamura K, Yasuda K (2011) Primary study of spiral dynamics inspired optimization. IEEJ Trans Elect Electron Eng 6:98–100
Tamura K, Yasuda K (2011) Spiral dynamics inspired optimization. J Adv Comput Intell Inf 15(8):1116–1122
Yang X-S (2010) Nature-inspired metaheuristic algorithms 2. Luniver Press, Frome
Tamura K, Yasuda K (2012) Quantitative analysis based tuning law for convergence rate of spiral optimization. In: Proceedings IEEE international conference on systems, man, and cybernetics, Seoul, South Korea, pp 767–772
Tamura K, Yasuda K (2016) Spiral optimization algorithm using periodic descent directions. SICE J Control Meas Syst Integr 9(3):134–143
Suzuki K, Tamura K, Yasuda K (2014) Study on cluster-structured spiral optimization. In: Proceedings of the IEEE international conference on systems, man, and cybernetics, San Diego, CA, USA, pp 94–99
Nasir ANK, Tokhi MO (2015) An improved spiral dynamic optimization algorithm with engineering application. IEEE Trans Syst Man Cybern Syst 45(6):943–954
Nasir ANK, Ismail RMTR, Tokhi MO (2016) Adaptive spiral dynamics metaheuristic algorithm for global optimisation with application to modelling of a flexible system. Appl Math Model 40(9–10):5442–5461
UCI-machine learning repository. http://archive.ics.uci.edu/ml/
Larsen B, Aone C (1999) Fast and effective text mining using linear-time document clustering
Steinbach M, Karypis G, Kumar V (2000) A comparison of document clustering techniques
Prakash KLNC, Anuradha K, Surya Narayana G (2020) A novel association approach to generate patterns for multi-valued data in efficient data classification. In: ICCCE 2020. Springer, Singapore, pp 1331–1342
Kapil S, Chawla M, Ansari MD (2016) On K-means data clustering algorithm with genetic algorithm. In 2016 Fourth international conference on parallel, distributed and grid computing (PDGC). IEEE, pp 202–206
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Prakash K., L.N.C., Surya Narayana, G., Ansari, M.D., Gunjan, V.K. (2022). Optimization of K-Means Clustering with Modified Spiral Phenomena. In: Kumar, A., Mozar, S. (eds) ICCCE 2021. Lecture Notes in Electrical Engineering, vol 828. Springer, Singapore. https://doi.org/10.1007/978-981-16-7985-8_126
Download citation
DOI: https://doi.org/10.1007/978-981-16-7985-8_126
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-7984-1
Online ISBN: 978-981-16-7985-8
eBook Packages: EngineeringEngineering (R0)