An indication of unification for different clustering approaches

DOI10.1016/j.patcog.2013.02.016zbMath1323.68431OpenAlexW2159452463MaRDI QIDQ888555

Jyrko Correa-Morris

Publication date: 30 October 2015

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2013.02.016

zbMATH Keywords

data clusteringimpossibility theoremclustering function

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (2)

Clustering with the average silhouette width ⋮ An empirical comparison and characterisation of nine popular clustering methods

Uses Software

• AS 136
• clusfind

Cites Work

• Unnamed Item
• Algorithm AS 136: A K-Means Clustering Algorithm
• Local equivalences of distances between clusterings -- a geometric perspective
• Kernel clustering-based discriminant analysis
• An incremental nested partition method for data clustering
• Weighted partition consensus via kernels
• Clustering aggregation by probability accumulation
• Clustering to minimize the maximum intercluster distance
• Structuralization of universes
• Mixture Densities, Maximum Likelihood and the EM Algorithm
• 10.1162/153244303321897735
• Computer Vision - ECCV 2004

This page was built for publication: An indication of unification for different clustering approaches