Comparing model-based versus k-means clustering for the planar shapes
zbMATH Open1460.62097MaRDI QIDQ4964907FDOQ4964907
Authors: Hamed Jafrai, Mousa Golalizadeh 
Publication date: 4 March 2021
Full work available at URL: http://ijmsi.ir/article-1-1080-en.html
Recommendations
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)
Cites Work
- Algorithm AS 136: A K-Means Clustering Algorithm
- Title not available (Why is that?)
- Shape Manifolds, Procrustean Metrics, and Complex Projective Spaces
- Title not available (Why is that?)
- Statistical shape analysis. With applications in R
- On clustering validation techniques
- Size and shape spaces for landmark data in two dimensions (with discussion)
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
- Title not available (Why is that?)
Uses Software
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)
