Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
12 views

K-Means and K-Modes Algorithms To Allow For Clustering Objects Described by Mix The K

The document discusses two algorithms, k-modes and k-prototypes, that extend the k-means algorithm to cluster data containing categorical values. The k-modes algorithm replaces cluster means with modes and uses a frequency-based method to update modes. The k-prototypes algorithm further integrates k-means and k-modes by defining a combined dissimilarity measure to cluster objects with mixed numeric and categorical attributes. Experiments show both algorithms efficiently cluster large real-world datasets.

Uploaded by

Prem Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views

K-Means and K-Modes Algorithms To Allow For Clustering Objects Described by Mix The K

The document discusses two algorithms, k-modes and k-prototypes, that extend the k-means algorithm to cluster data containing categorical values. The k-modes algorithm replaces cluster means with modes and uses a frequency-based method to update modes. The k-prototypes algorithm further integrates k-means and k-modes by defining a combined dissimilarity measure to cluster objects with mixed numeric and categorical attributes. Experiments show both algorithms efficiently cluster large real-world datasets.

Uploaded by

Prem Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

The k-means algorithm is well known for its efficiency in clustering large data sets.

However, working only on numeric values prohibits it from being used to cluster real world data containing categorical values. In this paper we present two algorithms which extend the kmeans to minimise the clustering cost function. With these extensions the k-modes algorithm enables the clustering of categorical data in a fashion similar to k-means. The k-prototypes algorithm, through the definition of a combined dissimilarity measure, further integrates the k-means and k-modes algorithms to allow for clustering objects described by mix The kmodes algorithm uses a simple matching dissimilarity measure to deal with categorical objects, replaces the means of clusters with modes, and uses a frequency-based method to update modes in the clustering process to minimise the clustering cost function. With these extensions the k-modes algorithm enables the clustering of categorical data in a fashion similar to k-means. The k- objects described by mix The k-modes algorithm uses a simple matching dissimilarity measure to deal with categorical objects, replaces the means of clusters with modes, and uses a frequency-based method to update modes in the clustering process to minimise the clustering cost function. With these extensions the k-modes algorithm enables the clustering of categorical data in a fashion similar to k-means. The kprototypes ed numeric and iments on two real world data sets with half a million objects each show that the two algorithms are efficient when clustering large data sets, which is critical to data mining applications.

You might also like