Mlpack::neighbor::neighborsearchrules sortpolicy, metrictype, treetype -
typedef
NeighborSearchTraversalInfo
< TreeType > TraversalInfoType"
Convenience typedef.
NeighborSearchRules (const typename TreeType::Mat &referenceSet, const typename TreeType::Mat &querySet, arma::Mat< size_t > &neighbors, arma::mat &distances, MetricType &metric)
double BaseCase (const size_t queryIndex, const size_t referenceIndex)
Get the distance from the query point to the reference point. size_t BaseCases () const
Get the number of base cases that have been performed. size_t & BaseCases ()
Modify the number of base cases that have been performed. double Rescore (const size_t queryIndex, TreeType &referenceNode, const double oldScore) const
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 (TreeType &queryNode, TreeType &referenceNode)
Get the score for recursion order. size_t Scores () const
Get the number of scores that have been performed. size_t & Scores ()
Modify the number of scores that have been performed. const TraversalInfoType & TraversalInfo () const
Get the traversal info. TraversalInfoType & TraversalInfo ()
Modify the traversal info.
double CalculateBound (TreeType &queryNode) const
Recalculate the bound for a given query node. void InsertNeighbor (const size_t queryIndex, const size_t pos, const size_t neighbor, const double distance)
Insert a point into the neighbors and distances matrices; this is a helper function.
size_t baseCases
The number of base cases that have been performed. arma::mat & distances
The matrix the resultant neighbor distances should be stored in. double lastBaseCase
The last base case result. size_t lastQueryIndex
The last query point BaseCase() was called with. size_t lastReferenceIndex
The last reference point BaseCase() was called with. MetricType & metric
The instantiated metric. arma::Mat< size_t > & neighbors
The matrix the resultant neighbor indices should be stored in. const TreeType::Mat & querySet
The query set. const TreeType::Mat & referenceSet
The reference set. size_t scores
The number of scores that have been performed. TraversalInfoType traversalInfo
Traversal info for the parent combination; this is updated by the traversal before each call to Score().
Definition at line 32 of file neighbor_search_rules.hpp.
Convenience typedef.
Definition at line 111 of file neighbor_search_rules.hpp.
Get the distance from the query point to the reference point. This will update the 'neighbor' matrix with the new point if appropriate and will track the number of base cases (number of points evaluated).
Parameters:
queryIndex Index of query point.
referenceIndex Index of reference point.
Get the number of base cases that have been performed.
Definition at line 101 of file neighbor_search_rules.hpp.
References mlpack::neighbor::NeighborSearchRules< SortPolicy, MetricType, TreeType >::baseCases.
Modify the number of base cases that have been performed.
Definition at line 103 of file neighbor_search_rules.hpp.
References mlpack::neighbor::NeighborSearchRules< SortPolicy, MetricType, TreeType >::baseCases.
Recalculate the bound for a given query node.
Insert a point into the neighbors and distances matrices; this is a helper function.
Parameters:
queryIndex Index of point whose neighbors we are inserting into.
pos Position in list to insert into.
neighbor Index of reference point which is being inserted.
distance Distance from query point to reference point.
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. 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 number of scores that have been performed.
Definition at line 106 of file neighbor_search_rules.hpp.
References mlpack::neighbor::NeighborSearchRules< SortPolicy, MetricType, TreeType >::scores.
Modify the number of scores that have been performed.
Definition at line 108 of file neighbor_search_rules.hpp.
References mlpack::neighbor::NeighborSearchRules< SortPolicy, MetricType, TreeType >::scores.
Get the traversal info.
Definition at line 114 of file neighbor_search_rules.hpp.
References mlpack::neighbor::NeighborSearchRules< SortPolicy, MetricType, TreeType >::traversalInfo.
Modify the traversal info.
Definition at line 116 of file neighbor_search_rules.hpp.
References mlpack::neighbor::NeighborSearchRules< SortPolicy, MetricType, TreeType >::traversalInfo.
The number of base cases that have been performed.
Definition at line 142 of file neighbor_search_rules.hpp.
Referenced by mlpack::neighbor::NeighborSearchRules< SortPolicy, MetricType, TreeType >::BaseCases().
The matrix the resultant neighbor distances should be stored in.
Definition at line 129 of file neighbor_search_rules.hpp.
The last base case result.
Definition at line 139 of file neighbor_search_rules.hpp.
The last query point BaseCase() was called with.
Definition at line 135 of file neighbor_search_rules.hpp.
The last reference point BaseCase() was called with.
Definition at line 137 of file neighbor_search_rules.hpp.
The instantiated metric.
Definition at line 132 of file neighbor_search_rules.hpp.
The matrix the resultant neighbor indices should be stored in.
Definition at line 126 of file neighbor_search_rules.hpp.
The query set.
Definition at line 123 of file neighbor_search_rules.hpp.
The reference set.
Definition at line 120 of file neighbor_search_rules.hpp.
The number of scores that have been performed.
Definition at line 144 of file neighbor_search_rules.hpp.
Referenced by mlpack::neighbor::NeighborSearchRules< SortPolicy, MetricType, TreeType >::Scores().
Traversal info for the parent combination; this is updated by the traversal before each call to Score().
Definition at line 148 of file neighbor_search_rules.hpp.
Referenced by mlpack::neighbor::NeighborSearchRules< SortPolicy, MetricType, TreeType >::TraversalInfo().
Generated automatically by Doxygen for MLPACK from the source code.