|
| DualTreeKMeansRules (const arma::mat ¢roids, const arma::mat &dataset, arma::Row< size_t > &assignments, arma::vec &upperBounds, arma::vec &lowerBounds, MetricType &metric, const std::vector< bool > &prunedPoints, const std::vector< size_t > &oldFromNewCentroids, std::vector< bool > &visited) |
|
double | BaseCase (const size_t queryIndex, const size_t referenceIndex) |
|
double | Score (const size_t queryIndex, TreeType &referenceNode) |
|
double | Score (TreeType &queryNode, TreeType &referenceNode) |
|
double | Rescore (const size_t queryIndex, TreeType &referenceNode, const double oldScore) |
|
double | Rescore (TreeType &queryNode, TreeType &referenceNode, const double oldScore) |
|
TraversalInfoType & | TraversalInfo () |
|
const TraversalInfoType & | TraversalInfo () const |
|
size_t | BaseCases () const |
|
size_t & | BaseCases () |
|
size_t | Scores () const |
|
size_t & | Scores () |
|
size_t | MinimumBaseCases () const |
| Get the minimum number of base cases needed for correct results for each query point. More...
|
|
◆ MinimumBaseCases()
template<typename MetricType , typename TreeType >
Get the minimum number of base cases needed for correct results for each query point.
This only matters in defeatist search mode.
The documentation for this class was generated from the following files: