Cargando…
The global Minmax k-means algorithm
The global k-means algorithm is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure from suitable initial positions, and employs k-means to minimize the sum of the intra-cluster variances. However the global k-means...
Autores principales: | Wang, Xiaoyan, Bai, Yanping |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5039165/ https://www.ncbi.nlm.nih.gov/pubmed/27733969 http://dx.doi.org/10.1186/s40064-016-3329-4 |
Ejemplares similares
-
A Modified MinMax k-Means Algorithm Based on PSO
por: Wang, Xiaoyan, et al.
Publicado: (2016) -
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
por: Ćwik, Michał, et al.
Publicado: (2017) -
Discrete optimization with interval data: minmax regret and fuzzy approach
por: Kasperski, Adam
Publicado: (2008) -
Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem
por: Nayak, Abhishek, et al.
Publicado: (2023) -
An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective
por: Faigl, Jan
Publicado: (2016)