#include <raft/core/handle.hpp>#include <raft/sparse/hierarchy/common.h>#include <cuvs/distance/distance.hpp>
Include dependency graph for linkage.hpp:
Go to the source code of this file.
Namespaces | |
| raft | |
| ML | |
Functions | |
| void | ML::single_linkage_pairwise (const raft::handle_t &handle, const float *X, size_t m, size_t n, raft::hierarchy::linkage_output< int > *out, cuvs::distance::DistanceType metric, int n_clusters=5) |
| Computes single-linkage hierarchical clustering on a dense input feature matrix and outputs the labels, dendrogram, and minimum spanning tree. Connectivities are constructed using the full n^2 pairwise distance matrix. This can be very fast for smaller datasets when there is enough memory available. More... | |
| void | ML::single_linkage_neighbors (const raft::handle_t &handle, const float *X, size_t m, size_t n, raft::hierarchy::linkage_output< int > *out, cuvs::distance::DistanceType metric=cuvs::distance::DistanceType::L2Unexpanded, int c=15, int n_clusters=5) |
| Computes single-linkage hierarchical clustering on a dense input feature matrix and outputs the labels, dendrogram, and minimum spanning tree. Connectivities are constructed using a k-nearest neighbors graph. While this strategy enables the algorithm to scale to much higher numbers of rows, it comes with the downside that additional knn steps may need to be executed to connect an otherwise unconnected k-nn graph. More... | |
| void | ML::single_linkage_pairwise (const raft::handle_t &handle, const float *X, size_t m, size_t n, raft::hierarchy::linkage_output< int64_t > *out, cuvs::distance::DistanceType metric, int n_clusters=5) |
