Affiliation:
1. Acharya Nagarjuna University, Guntur, India
2. Lakireddy Bali Reddy College of Engineering, Mylavaram, India
Abstract
This article proposes a new optimal data clustering method for finding optimal clusters of data by incorporating chaotic maps into the standard NOA. NOA, a newly developed optimization technique, has been shown to be efficient in generating optimal results with lowest solution cost. The incorporation of chaotic maps into metaheuristics enables algorithms to diversify the solution space into two phases: explore and exploit more. To make the NOA more efficient and avoid premature convergence, chaotic maps are incorporated in this work, termed as CNOAs. Ten different chaotic maps are incorporated individually into standard NOA for testing the optimization performance. The CNOA is first benchmarked on 23 standard functions. Secondly, testing was done on the numerical complexity of the new clustering method which utilizes CNOA, by solving 10 UCI data cluster problems and 4 web document cluster problems. The comparisons have been made with the help of obtaining statistical and graphical results. The superiority of the proposed optimal clustering algorithm is evident from the simulations and comparisons.
Reference47 articles.
1. Aarts, E., & Korst, J. (1988). Simulated annealing and Boltzmann machines. U.S. Dept. of Energy.
2. Research on particle swarm optimization based clustering: A systematic review of literature and techniques
3. Boosting Algorithm and Meta-Heuristic Based on Genetic Algorithms for Textual Plagiarism Detection
4. Brownlee, J. (2016). Supervised and unsupervised machine learning algorithms. Machine Learning Mastery, 16(3).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献