Mathur, Anisha and Vardhan, Harsha and Arjun, C V (2018) Cluster Analysis. Journal of Advanced Research in Dynamical and Control Systems, 18. pp. 1272-1285. ISSN 1943023X
![]() |
PDF
3988.pdf - Published Version Restricted to Registered users only Download (786kB) | Request a copy |
Abstract
Clustering is the method of organizing objects having similar properties in one group and those having dissimilar properties in a separate group. It is the most important form of unsupervised learning. Clustering aims at the natural grouping in a set containing unlabeled data. A good clustering is one which satisfies the user’s information needs based on the user specified criterion. Clustering can be used for data reduction, finding out data types of data members, detecting outliers etc. Clustering algorithms could be applied in various fields like marketing, insurance, studies of natural disasters, WWW, etc. There are different algorithms to deal with various types of data. To find out the best suitable algorithm for our dataset, we need to be able to compare these algorithms. This paper describes the various clustering algorithms and their applications and limitations
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Clustering, Density based clustering, Hierarchical clustering, Partitional clustering |
Subjects: | Engineering > MIT Manipal > Information and Communication Technology |
Depositing User: | MIT Library |
Date Deposited: | 14 Feb 2018 09:29 |
Last Modified: | 14 Feb 2018 09:29 |
URI: | http://eprints.manipal.edu/id/eprint/150584 |
Actions (login required)
![]() |
View Item |