A clustering algorithm based on set dissimilarity for high dimensional data of categorical attributes
From MaRDI portal
Publication:3170758
zbMATH Open1240.68282MaRDI QIDQ3170758FDOQ3170758
Authors: Sen Wu, Guiying Wei, Chen Bai, Guiqiong Zhang
Publication date: 29 September 2011
Recommendations
- A novel attribute weighting algorithm for clustering high-dimensional categorical data
- A k-Means-Like Algorithm for Clustering Categorical Data Using an Information Theoretic-Based Dissimilarity Measure
- A clustering algorithm for categorical variables based on connected components
- scientific article; zbMATH DE number 2170297
- A fuzzy SV-\(k\)-modes algorithm for clustering categorical data with set-valued attributes
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Database theory (68P15)
Cited In (6)
- Rough subspace-based clustering ensemble for categorical data
- A clustering algorithm for categorical variables based on connected components
- A novel attribute weighting algorithm for clustering high-dimensional categorical data
- Title not available (Why is that?)
- Holo-entropy based categorical data hierarchical clustering
- CNODE: clustering of set-valued non-ordered discrete data
This page was built for publication: A clustering algorithm based on set dissimilarity for high dimensional data of categorical attributes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170758)