z-logo
open-access-imgOpen Access
A trainable clustering algorithm based on shortest paths from density peaks
Author(s) -
Diego Ulisse Pizzagalli,
Santiago González,
Rolf Krause
Publication year - 2019
Publication title -
science advances
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 5.928
H-Index - 146
ISSN - 2375-2548
DOI - 10.1126/sciadv.aax3770
Subject(s) - shortest path problem , computer science , cluster analysis , path (computing) , artificial intelligence , algorithm , pattern recognition (psychology) , data mining , theoretical computer science , graph , programming language
By considering knowledge as a path, machines and humans can collaboratively analyze complex biomedical datasets.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom