2001
DOI: 10.1007/s00357-001-0004-3
|View full text |Cite
|
Sign up to set email alerts
|

K-modes Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
102
0
2

Year Published

2007
2007
2021
2021

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 229 publications
(106 citation statements)
references
References 12 publications
1
102
0
2
Order By: Relevance
“…To resolve this difficulty, Chaturvedi, Green, and Carroll (2001) proposed K-modes clustering, in which clusters are represented by category labels and the loss function is a counting measure.…”
Section: Clustering Models and Methodsmentioning
confidence: 99%
“…To resolve this difficulty, Chaturvedi, Green, and Carroll (2001) proposed K-modes clustering, in which clusters are represented by category labels and the loss function is a counting measure.…”
Section: Clustering Models and Methodsmentioning
confidence: 99%
“…The k-modes algorithm is similar to k-means, while the data in k-means should have numeric attributes, k-modes can cluster data with nominal (categorical) attributes [37].…”
Section: Partition-based Clustering Approachesmentioning
confidence: 99%
“…The clustering algorithm is the K-modes algorithm [7,10,12] which uses the K-means paradigm to cluster categorical data. Let W = [w n,k ] be an N-by-K matrix represents the partitioning of all records into K clusters, where one record is dedicated to one cluster, and let…”
Section: The Clustering Algorithmmentioning
confidence: 99%
“…They have shown that the K-modes algorithm converges in a finite number of iterations. For the K-modes algorithm, we refer to [7,12] for details. Here we first fix V and find necessary conditions on W to minimize F .…”
Section: The Clustering Algorithmmentioning
confidence: 99%