The utility of clusters and a Hungarian clustering algorithm
Implicit in the k–means algorithm is a way to assign a value, or utility, to a cluster of points. It works by taking the centroid of the points and the value of the cluster is the sum of distances from the centroid to each point in the cluster. The aim in this paper is to introduce an alternative wa...
Main Authors: | Alfred Kume, Stephen G. Walker |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2021-01-01
|
Series: | PLoS ONE |
Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8336801/?tool=EBI |
Similar Items
-
The utility of clusters and a Hungarian clustering algorithm.
by: Alfred Kume, et al.
Published: (2021-01-01) -
Analysis of Sectoral Features in Hungarian Accredited Innovation Clusters
by: Ildikó Petruska, et al.
Published: (2016-07-01) -
Analysis of Sectoral Features in Hungarian Accredited Innovation Clusters
by: Ildikó Petruska, et al.
Published: (2016-07-01) -
Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale.
by: Scott Emmons, et al.
Published: (2016-01-01) -
The Fundamental Clustering and Projection Suite (FCPS): A Dataset Collection to Test the Performance of Clustering and Data Projection Algorithms
by: Alfred Ultsch, et al.
Published: (2020-01-01)