Iterative Min Cut Clustering Based on Graph Cuts

Clustering nonlinearly separable datasets is always an important problem in unsupervised machine learning. Graph cut models provide good clustering results for nonlinearly separable datasets, but solving graph cut models is an NP hard problem. A novel graph-based clustering algorithm is proposed for...

Descripción completa

Detalles Bibliográficos
Autores principales: Liu, Bowen, Liu, Zhaoying, Li, Yujian, Zhang, Ting, Zhang, Zhilin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Communication
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7827042/
https://www.ncbi.nlm.nih.gov/pubmed/33440849
http://dx.doi.org/10.3390/s21020474

Ejemplares similares

Ejemplares similares