Mlpack::emst::dtbrules metrictype, treetype -
typedef
neighbor::NeighborSearchTraversalInfo
< TreeType > TraversalInfoType"
DTBRules (const arma::mat &dataSet, UnionFind &connections, arma::vec &neighborsDistances, arma::Col< size_t > &neighborsInComponent, arma::Col< size_t > &neighborsOutComponent, MetricType &metric)
double BaseCase (const size_t queryIndex, const size_t referenceIndex)
size_t BaseCases () const
Get the number of base cases performed. size_t & BaseCases ()
Modify the number of base cases performed. double Rescore (const size_t queryIndex, TreeType &referenceNode, const double oldScore)
Re-evaluate the score for recursion order. double Rescore (TreeType &queryNode, TreeType &referenceNode, const double oldScore) const
Re-evaluate the score for recursion order. double Score (const size_t queryIndex, TreeType &referenceNode)
Get the score for recursion order. double Score (const size_t queryIndex, TreeType &referenceNode, const double baseCaseResult)
Get the score for recursion order, passing the base case result (in the situation where it may be needed to calculate the recursion order). double Score (TreeType &queryNode, TreeType &referenceNode)
Get the score for recursion order. double Score (TreeType &queryNode, TreeType &referenceNode, const double baseCaseResult)
Get the score for recursion order, passing the base case result (in the situation where it may be needed to calculate the recursion order). size_t Scores () const
Get the number of node combinations that have been scored. size_t & Scores ()
Modify the number of node combinations that have been scored. const TraversalInfoType & TraversalInfo () const
TraversalInfoType & TraversalInfo ()
double CalculateBound (TreeType &queryNode) const
Update the bound for the given query node.
size_t baseCases
The number of base cases calculated. UnionFind & connections
Stores the tree structure so far. const arma::mat & dataSet
The data points. MetricType & metric
The instantiated metric. arma::vec & neighborsDistances
The distance to the candidate nearest neighbor for each component. arma::Col< size_t > & neighborsInComponent
The index of the point in the component that is an endpoint of the candidate edge. arma::Col< size_t > & neighborsOutComponent
The index of the point outside of the component that is an endpoint of the candidate edge. size_t scores
The number of node combinations that have been scored. TraversalInfoType traversalInfo
Definition at line 33 of file dtb_rules.hpp.
Definition at line 123 of file dtb_rules.hpp.
Get the number of base cases performed.
Definition at line 129 of file dtb_rules.hpp.
References mlpack::emst::DTBRules< MetricType, TreeType >::baseCases.
Modify the number of base cases performed.
Definition at line 131 of file dtb_rules.hpp.
References mlpack::emst::DTBRules< MetricType, TreeType >::baseCases.
Update the bound for the given query node.
Re-evaluate the score for recursion order. A low score indicates priority for recursion, while DBL_MAX indicates that the node should not be recursed into at all (it should be pruned). This is used when the score has already been calculated, but another recursion may have modified the bounds for pruning. So the old score is checked against the new pruning bound.
Parameters:
queryIndex Index of query point.
referenceNode Candidate node to be recursed into.
oldScore Old score produced by Score() (or Rescore()).
Re-evaluate the score for recursion order. A low score indicates priority for recursion, while DBL_MAX indicates that the node should not be recursed into at all (it should be pruned). This is used when the score has already been calculated, but another recursion may have modified the bounds for pruning. So the old score is checked against the new pruning bound.
Parameters:
queryNode Candidate query node to recurse into.
referenceNode Candidate reference node to recurse into.
oldScore Old score produced by Socre() (or Rescore()).
Get the score for recursion order. A low score indicates priority for recursion, while DBL_MAX indicates that the node should not be recursed into at all (it should be pruned).
Parameters:
queryIndex Index of query point.
referenceNode Candidate node to be recursed into.
Get the score for recursion order, passing the base case result (in the situation where it may be needed to calculate the recursion order). A low score indicates priority for recursion, while DBL_MAX indicates that the node should not be recursed into at all (it should be pruned).
Parameters:
queryIndex Index of query point.
referenceNode Candidate node to be recursed into.
baseCaseResult Result of BaseCase(queryIndex, referenceNode).
Get the score for recursion order. A low score indicates priority for recursionm while DBL_MAX indicates that the node should not be recursed into at all (it should be pruned).
Parameters:
queryNode Candidate query node to recurse into.
referenceNode Candidate reference node to recurse into.
Get the score for recursion order, passing the base case result (in the situation where it may be needed to calculate the recursion order). A low score indicates priority for recursion, while DBL_MAX indicates that the node should not be recursed into at all (it should be pruned).
Parameters:
queryNode Candidate query node to recurse into.
referenceNode Candidate reference node to recurse into.
baseCaseResult Result of BaseCase(queryIndex, referenceNode).
Get the number of node combinations that have been scored.
Definition at line 134 of file dtb_rules.hpp.
References mlpack::emst::DTBRules< MetricType, TreeType >::scores.
Modify the number of node combinations that have been scored.
Definition at line 136 of file dtb_rules.hpp.
References mlpack::emst::DTBRules< MetricType, TreeType >::scores.
Definition at line 125 of file dtb_rules.hpp.
References mlpack::emst::DTBRules< MetricType, TreeType >::traversalInfo.
Definition at line 126 of file dtb_rules.hpp.
References mlpack::emst::DTBRules< MetricType, TreeType >::traversalInfo.
The number of base cases calculated.
Definition at line 167 of file dtb_rules.hpp.
Referenced by mlpack::emst::DTBRules< MetricType, TreeType >::BaseCases().
Stores the tree structure so far.
Definition at line 143 of file dtb_rules.hpp.
The data points.
Definition at line 140 of file dtb_rules.hpp.
The instantiated metric.
Definition at line 157 of file dtb_rules.hpp.
The distance to the candidate nearest neighbor for each component.
Definition at line 146 of file dtb_rules.hpp.
The index of the point in the component that is an endpoint of the candidate edge.
Definition at line 150 of file dtb_rules.hpp.
The index of the point outside of the component that is an endpoint of the candidate edge.
Definition at line 154 of file dtb_rules.hpp.
The number of node combinations that have been scored.
Definition at line 169 of file dtb_rules.hpp.
Referenced by mlpack::emst::DTBRules< MetricType, TreeType >::Scores().
Definition at line 164 of file dtb_rules.hpp.
Referenced by mlpack::emst::DTBRules< MetricType, TreeType >::TraversalInfo().
Generated automatically by Doxygen for MLPACK from the source code.