Comparing model-based versus k-means clustering for the planar shapes
From MaRDI portal
Publication:4964907
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Image analysis in multivariate analysis (62H35) Statistics on manifolds (62R30) General biology and biomathematics (92B05) Shapes (aspects of topological manifolds) (57N25)
Recommendations
Cites work
- scientific article; zbMATH DE number 1194132 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- Algorithm AS 136: A K-Means Clustering Algorithm
- On clustering validation techniques
- Shape Manifolds, Procrustean Metrics, and Complex Projective Spaces
- Size and shape spaces for landmark data in two dimensions (with discussion)
- Statistical shape analysis. With applications in R
Cited in
(6)- On representative functions method for clustering of 2D contours with application to pottery fragments typology
- A comparative study of some clustering algorithms on shape data
- A comprehensive study of clustering a class of 2D shapes
- The \(k\)-means algorithm for 3D shapes with an application to apparel design
- \(k\)-means algorithm in statistical shape analysis
- scientific article; zbMATH DE number 1163284 (Why is no real title available?)
This page was built for publication: Comparing model-based versus \(k\)-means clustering for the planar shapes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964907)