Clustering Categorical Data via Ensembling Dissimilarity Matrices

DOI10.1080/10618600.2017.1305278OpenAlexW3104318432MaRDI QIDQ3391144

Saeid Amiri, Jennifer Lynn Clarke, Bertrand S. Clarke

Publication date: 28 March 2022

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10618600.2017.1305278

zbMATH Keywords

stabilityHamming distancehigh-dimensional datasequence alignmentcategorical dataclassification and clustering

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (1)

Optimal transport, mean partition, and uncertainty assessment in cluster analysis

Uses Software

• Silhouettes
• UCI-ml
• ape
• PLINK
• clustvarsel
• MAFFT
• MUSCLE
• sparcl
• COSA
• ROCK

Cites Work

• Unnamed Item
• Unnamed Item
• Bagging predictors
• Estimating the Number of Clusters in a Data Set Via the Gap Statistic
• On ultrametricity, data coding, and computation
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• A novel attribute weighting algorithm for clustering high-dimensional categorical data
• On Using Principal Components Before Separating a Mixture of Two Multivariate Normal Distributions
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• Clustering Objects on Subsets of Attributes (with Discussion)
• Statement forNaval Research Logistics
• 10.1162/153244303321897735
• A Framework for Feature Selection in Clustering
• Variable Selection for Model-Based Clustering
• Clustering Categorical Data Based on Distance Vectors

This page was built for publication: Clustering Categorical Data via Ensembling Dissimilarity Matrices