Point clustering via voting maximization

DOI10.1007/s00357-015-9182-2zbMath1335.62106OpenAlexW765106422MaRDI QIDQ269543

Costas Panagiotakis

Publication date: 19 April 2016

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-015-9182-2

zbMATH Keywords

partitionclusteringvoting\(K\)-meanspartitional clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (4)

Local and overall deviance R-squared measures for mixtures of generalized linear models ⋮ Multiclass classification based on multi-criteria decision-making ⋮ Cluster validation for mixtures of regressions via the total sum of squares decomposition ⋮ An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers

Uses Software

• UCI-ml
• apcluster
• APCluster
• k-means++

Cites Work

• Clustering by Passing Messages Between Data Points
• Clustering large graphs via the singular value decomposition
• Efficient algorithms for agglomerative hierarchical clustering methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Point clustering via voting maximization