Cargando…
Efficient similarity-based data clustering by optimal object to cluster reallocation
We present an iterative flat hard clustering algorithm designed to operate on arbitrary similarity matrices, with the only constraint that these matrices be symmetrical. Although functionally very close to kernel k-means, our proposal performs a maximization of average intra-class similarity, instea...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5983489/ https://www.ncbi.nlm.nih.gov/pubmed/29856755 http://dx.doi.org/10.1371/journal.pone.0197450 |