Cargando…
A Modified MinMax k-Means Algorithm Based on PSO
The MinMax k-means algorithm is widely used to tackle the effect of bad initialization by minimizing the maximum intraclustering errors. Two parameters, including the exponent parameter and memory parameter, are involved in the executive process. Since different parameters have different clustering...
Autores principales: | Wang, Xiaoyan, Bai, Yanping |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5021908/ https://www.ncbi.nlm.nih.gov/pubmed/27656201 http://dx.doi.org/10.1155/2016/4606384 |
Ejemplares similares
-
The global Minmax k-means algorithm
por: Wang, Xiaoyan, et al.
Publicado: (2016) -
Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem
por: Nayak, Abhishek, et al.
Publicado: (2023) -
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
por: Ćwik, Michał, et al.
Publicado: (2017) -
Canonical PSO Based K-Means Clustering Approach for Real Datasets
por: Dey, Lopamudra, et al.
Publicado: (2014) -
An Integrated Method Based on PSO and EDA for the Max-Cut Problem
por: Lin, Geng, et al.
Publicado: (2016)