#include <hdbscan.hpp>
Public Member Functions | |
robust_single_linkage_output (const raft::handle_t &handle_, int n_leaves_, value_idx *labels_, value_idx *children_, value_idx *sizes_, value_t *deltas_, value_idx *mst_src_, value_idx *mst_dst_, value_t *mst_weights_) | |
int | get_n_leaves () const |
int | get_n_clusters () const |
value_idx * | get_labels () |
value_idx * | get_children () |
value_idx * | get_sizes () |
value_t * | get_deltas () |
value_idx * | get_mst_src () |
value_idx * | get_mst_dst () |
value_t * | get_mst_weights () |
void | set_n_clusters (int n_clusters_) |
Protected Member Functions | |
const raft::handle_t & | get_handle () |
Protected Attributes | |
const raft::handle_t & | handle |
int | n_leaves |
int | n_clusters |
value_idx * | labels |
value_idx * | children |
value_idx * | sizes |
value_t * | deltas |
value_idx * | mst_src |
value_idx * | mst_dst |
value_t * | mst_weights |
Container object for output information common between robust single linkage variants.
value_idx | |
value_t |
|
inline |
Construct output object with empty device arrays of known size.
handle_ | raft handle for ordering cuda operations |
n_leaves_ | number of data points |
labels_ | labels array on device (size n_leaves) |
children_ | dendrogram src/dst array (size n_leaves - 1, 2) |
sizes_ | dendrogram cluster sizes array (size n_leaves - 1) |
deltas_ | dendrogram distances array (size n_leaves - 1) |
mst_src_ | min spanning tree source array (size n_leaves - 1) |
mst_dst_ | min spanning tree destination array (size n_leaves - 1) |
mst_weights_ | min spanninng tree distances array (size n_leaves - 1) |
|
inline |
|
inline |
|
inlineprotected |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
The number of clusters is set by the algorithm once it is known.
n_clusters_ | number of resulting clusters |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |