A k-Means-Like Algorithm for Clustering Categorical Data Using an Information Theoretic-Based Dissimilarity Measure
DOI10.1007/978-3-319-30024-5_7zbMATH Open1475.68288OpenAlexW2418423341MaRDI QIDQ2807075FDOQ2807075
Authors: Thu Hien Nguyen, Van-Nam Huynh 
Publication date: 19 May 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-30024-5_7
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cited In (8)
- Title not available (Why is that?)
- An optimization algorithm for clustering using weighted dissimilarity measures
- Advances in Intelligent Data Analysis VI
- An iterative initial-points refinement algorithm for categorical data clustering
- A clustering algorithm based on set dissimilarity for high dimensional data of categorical attributes
- Title not available (Why is that?)
- A hierarchical clustering algorithm for categorical sequence data
- Title not available (Why is that?)
Uses Software
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)
