10#include <memory_resource>
11#include <nk/value/value.hpp>
40 std::pmr::memory_resource *mr =
nullptr);
53 const std::string &metric,
double p,
54 std::pmr::memory_resource *mr =
nullptr);
68 const std::string &criterion,
69 std::pmr::memory_resource *mr =
nullptr);
83 const std::string &criterion,
int depth,
84 std::pmr::memory_resource *mr =
nullptr);
96 const std::string &linkage_method,
97 const std::string &criterion,
98 std::pmr::memory_resource *mr =
nullptr);
113 const std::string &linkage_method,
114 const std::string &criterion,
int depth,
115 std::pmr::memory_resource *mr =
nullptr);
132 const std::string &linkage_method,
133 const std::string &criterion,
int depth,
134 const std::string &distance_metric,
double p,
135 std::pmr::memory_resource *mr =
nullptr);
149 std::pmr::memory_resource *mr =
nullptr);
165 std::pmr::memory_resource *mr =
nullptr);
Core MATLAB-compatible multidimensional array and scalar value type.
Value linkage(const Value &Y, const std::string &method, std::pmr::memory_resource *mr=nullptr)
Agglomerative hierarchical clustering tree (Z = linkage(Y, method)).
Value clusterdata(const Value &X, int maxclust, double cutoff, const std::string &linkage_method, const std::string &criterion, std::pmr::memory_resource *mr=nullptr)
Convenience: pdist + linkage + cluster in one call (clusterdata).
Value inconsistent(const Value &Z, int depth, std::pmr::memory_resource *mr=nullptr)
Inconsistency coefficient table (R = inconsistent(Z, depth)).
Value cophenet(const Value &Z, const Value &Y, std::pmr::memory_resource *mr=nullptr)
Cophenetic correlation (c = cophenet(Z, Y)).
Value cluster_from_linkage(const Value &Z, int maxclust, double cutoff, const std::string &criterion, std::pmr::memory_resource *mr=nullptr)
Flatten a linkage tree into cluster labels (T = cluster(Z, opts)).