Abstract
Clustering is a data mining technique that classifies a set of observations into several clusters based on some similarity measures. The most commonly used partitioning based clustering algorithm is K-means. However, the K-means algorithm has several drawbacks. The algorithm generates a local optimal solution based on the randomly chosen initial centroids. A recently developed meta heuristic optimization algorithm named harmony search helps to find out near global optimal solutions by searching the entire solution space. K-means performs a localized searching. Studies have shown that hybrid algorithm that combines the two ideas will produce a better solution. In this paper, a new approach that combines the improved harmony search optimization technique and an enhanced K-means algorithm is proposed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
