Cargando…
A trainable clustering algorithm based on shortest paths from density peaks
Clustering is a technique to analyze empirical data, with a major application for biomedical research. Essentially, clustering finds groups of related points in a dataset. However, results depend on both metrics for point-to-point similarity and rules for point-to-group association. Non-appropriate...
Autores principales: | Pizzagalli, Diego Ulisse, Gonzalez, Santiago Fernandez, Krause, Rolf |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
American Association for the Advancement of Science
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7051829/ https://www.ncbi.nlm.nih.gov/pubmed/32195334 http://dx.doi.org/10.1126/sciadv.aax3770 |
Ejemplares similares
-
Euclidean shortest paths: exact or approximate algorithms
por: Li, Fajie, et al.
Publicado: (2014) -
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
por: Zhang, Xiaoge, et al.
Publicado: (2014) -
Distributed algorithms from arboreal ants for the shortest path problem
por: Garg, Shivam, et al.
Publicado: (2023) -
Shortest Paths in Multiplex Networks
por: Ghariblou, Saeed, et al.
Publicado: (2017) -
Multiple Object Tracking Using the Shortest Path Faster Association Algorithm
por: Xi, Zhenghao, et al.
Publicado: (2014)