Cargando...
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...
Gardado en:
| Publicado en: | Sensors (Basel) |
|---|---|
| Main Authors: | , , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
MDPI
2021
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7827042/ https://ncbi.nlm.nih.gov/pubmed/33440849 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/s21020474 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|