A k-Means-Like Algorithm for Clustering Categorical Data Using an Information Theoretic-Based Dissimilarity Measure
From MaRDI portal
Publication:2807075
Recommendations
- scientific article; zbMATH DE number 2170297
- Clustering Categorical Data via Ensembling Dissimilarity Matrices
- A \(k\)-populations algorithm for clustering categorical data
- scientific article; zbMATH DE number 5012235
- Clustering with respect to the information distance
- The clustering of categorical data: a comparison of a model-based and a distance-based approach
- Comparing clusterings -- an information based distance
Cited in
(11)- A clustering algorithm based on set dissimilarity for high dimensional data of categorical attributes
- scientific article; zbMATH DE number 2088095 (Why is no real title available?)
- An extension of the \(K\)-means algorithm to clustering skewed data
- Advances in Intelligent Data Analysis VI
- An iterative initial-points refinement algorithm for categorical data clustering
- scientific article; zbMATH DE number 1759248 (Why is no real title available?)
- A clustering algorithm for categorical variables based on connected components
- A hierarchical clustering algorithm for categorical sequence data
- An optimization algorithm for clustering using weighted dissimilarity measures
- Comparison of similarity measures for categorical data in hierarchical clustering
- scientific article; zbMATH DE number 2170297 (Why is no real title available?)
This page was built for publication: A k-Means-Like Algorithm for Clustering Categorical Data Using an Information Theoretic-Based Dissimilarity Measure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807075)