K-Medoid Clustering for Heterogeneous DataSets

13Citations
Citations of this article
58Readers
Mendeley users who have this article in their library.

Abstract

Recent years have explored various clustering strategies to partition datasets comprising of heterogeneous domains or types such as categorical, numerical and binary. Clustering algorithms seek to identify homogeneous groups of objects based on the values of their attributes. These algorithms either assume the attributes to be of homogeneous types or are converted into homogeneous types. However, datasets with heterogeneous data types are common in real life applications, which if converted, can lead to loss of information. This paper proposes a new similarity measure in the form of triplet to find the distance between two data objects with heterogeneous attribute types. A new k-medoid type of clustering algorithm is proposed by leveraging the similarity measure in the form of a vector. The proposed k-medoid type of clustering algorithm is compared with traditional clustering algorithms, based on cluster validation using Purity Index and Davies Bouldin index. Results show that the new clustering algorithm with new similarity measure outperforms the k-means clustering for mixed datasets.

Cite

CITATION STYLE

APA

Harikumar, S., & Surya, P. V. (2015). K-Medoid Clustering for Heterogeneous DataSets. In Procedia Computer Science (Vol. 70, pp. 226–237). Elsevier B.V. https://doi.org/10.1016/j.procs.2015.10.077

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