Comprehensive analysis of data clustering algorithms

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

Abstract

We have given a comprehensive comparative analysis of various clustering algorithms. Clustering algorithms usually employ distance metric or similarity matrix to cluster the data set into different partitions. Well known clustering algorithms have been widely used in various disciplines. Type of clustering algorithm used depends upon the application and data set used in that field. Numerical data set is comparatively easy to implement as data are invariably real numbers. Others type of data set such as categorical, time series, boolean, and spatial, temporal have limited applications. It is observed that there is no optimal solution for handling problems with large data sets of mixed and categorical attributes. Some of the algorithms can be applied but their performance degrades as the size of data keeps on increasing. © 2013 Springer Science+Business Media Dordrecht.

Cite

CITATION STYLE

APA

Gaur, D., & Gaur, S. (2013). Comprehensive analysis of data clustering algorithms. In Lecture Notes in Electrical Engineering (Vol. 235 LNEE, pp. 753–762). https://doi.org/10.1007/978-94-007-6516-0_84

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