Cargando...
Splitting Methods for Convex Clustering
Clustering is a fundamental problem in many scientific applications. Standard methods such as k-means, Gaussian mixture models, and hierarchical clustering, however, are beset by local minima, which are sometimes drastically suboptimal. Recently introduced convex relaxations of k-means and hierarchi...
Gardado en:
Publicado en: | J Comput Graph Stat |
---|---|
Main Authors: | , |
Formato: | Artigo |
Idioma: | Inglês |
Publicado: |
2015
|
Assuntos: | |
Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4830509/ https://ncbi.nlm.nih.gov/pubmed/27087770 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1080/10618600.2014.948181 |
Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|