![]() |
SemiDiscreteOT 1.0
Semi-Discrete Optimal Transport Library
|
#include "dkm.hpp"
#include <algorithm>
#include <array>
#include <tuple>
#include <vector>
#include <fstream>
#include <iterator>
#include <regex>
Go to the source code of this file.
Namespaces | |
namespace | dkm |
namespace | dkm::details |
Functions | |
std::vector< std::string > | dkm::details::split_commas (const std::string &line) |
template<typename T , size_t N> | |
std::vector< T > | dkm::dist_to_center (const std::vector< std::array< T, N > > &points, const std::array< T, N > ¢er) |
template<typename T , size_t N> | |
T | dkm::sum_dist (const std::vector< std::array< T, N > > &points, const std::array< T, N > ¢er) |
template<typename T , size_t N> | |
std::vector< std::array< T, N > > | dkm::get_cluster (const std::vector< std::array< T, N > > &points, const std::vector< uint32_t > &labels, const uint32_t label) |
template<typename T , size_t N> | |
T | dkm::means_inertia (const std::vector< std::array< T, N > > &points, const std::tuple< std::vector< std::array< T, N > >, std::vector< uint32_t > > &means, uint32_t k) |
template<typename T , size_t N> | |
std::tuple< std::vector< std::array< T, N > >, std::vector< uint32_t > > | dkm::get_best_means (const std::vector< std::array< T, N > > &points, uint32_t k, uint32_t n_init=10) |
template<typename T , size_t N> | |
size_t | dkm::predict (const std::vector< std::array< T, N > > ¢roids, const std::array< T, N > &query) |
template<typename T , size_t N> | |
std::vector< std::array< T, N > > | dkm::load_csv (const std::string &path) |