A new hybrid clustering approach based on heuristic Kalman algorithm

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Clustering is an important methodology for data mining and data analysis. K-Means is a simple and fast algorithm for clustering data. However the performance of K-means is highly sensitive on the initial seed of the algorithm. Heuristic Kalman Algorithm (HKA) is a population based stochastic optimization technique which is an effective method for searching a near-optimal solution of a function. Although HKA has good global search characteristics, it is shown that when directly applied on clustering it performs poorly. This paper proposes a new approach KHKA, which combines the benefits of the global nature of HKA and the fast convergence of K-means. KHKA was implemented and benchmarked on synthetic and real datasets from UCI Machine Learning Repository. The results were compared with other population based, stochastic algorithms. Results show that KHKA is a promising algorithm and was able to perform better than the compared algorithms with respect to the used datasets.

Cite

CITATION STYLE

APA

Pakrashi, A. (2015). A new hybrid clustering approach based on heuristic Kalman algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8947, pp. 445–455). Springer Verlag. https://doi.org/10.1007/978-3-319-20294-5_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free