mlpack
2.0.1
|
Public Types | |
typedef neighbor::NeighborSearchTraversalInfo< TreeType > | TraversalInfoType |
Public Member Functions | |
RangeSearchRules (const arma::mat &referenceSet, const arma::mat &querySet, const math::Range &range, std::vector< std::vector< size_t > > &neighbors, std::vector< std::vector< double > > &distances, MetricType &metric, const bool sameSet=false) | |
Construct the RangeSearchRules object. More... | |
double | BaseCase (const size_t queryIndex, const size_t referenceIndex) |
Compute the base case between the given query point and reference point. More... | |
size_t | BaseCases () const |
Get the number of base cases. More... | |
double | Rescore (const size_t queryIndex, TreeType &referenceNode, const double oldScore) const |
Re-evaluate the score for recursion order. More... | |
double | Rescore (TreeType &queryNode, TreeType &referenceNode, const double oldScore) const |
Re-evaluate the score for recursion order. More... | |
double | Score (const size_t queryIndex, TreeType &referenceNode) |
Get the score for recursion order. More... | |
double | Score (TreeType &queryNode, TreeType &referenceNode) |
Get the score for recursion order. More... | |
size_t | Scores () const |
Get the number of scores (that is, calls to RangeDistance()). More... | |
const TraversalInfoType & | TraversalInfo () const |
TraversalInfoType & | TraversalInfo () |
Private Member Functions | |
void | AddResult (const size_t queryIndex, TreeType &referenceNode) |
Add all the points in the given node to the results for the given query point. More... | |
Private Attributes | |
size_t | baseCases |
The number of base cases. More... | |
std::vector< std::vector< double > > & | distances |
The vector the resultant neighbor distances should be stored in. More... | |
size_t | lastQueryIndex |
The last query index. More... | |
size_t | lastReferenceIndex |
The last reference index. More... | |
MetricType & | metric |
The instantiated metric. More... | |
std::vector< std::vector< size_t > > & | neighbors |
The vector the resultant neighbor indices should be stored in. More... | |
const arma::mat & | querySet |
The query set. More... | |
const math::Range & | range |
The range of distances for which we are searching. More... | |
const arma::mat & | referenceSet |
The reference set. More... | |
bool | sameSet |
If true, the query and reference set are taken to be the same. More... | |
size_t | scores |
THe number of scores. More... | |
TraversalInfoType | traversalInfo |
Definition at line 24 of file range_search_rules.hpp.
typedef neighbor::NeighborSearchTraversalInfo<TreeType> mlpack::range::RangeSearchRules< MetricType, TreeType >::TraversalInfoType |
Definition at line 106 of file range_search_rules.hpp.
mlpack::range::RangeSearchRules< MetricType, TreeType >::RangeSearchRules | ( | const arma::mat & | referenceSet, |
const arma::mat & | querySet, | ||
const math::Range & | range, | ||
std::vector< std::vector< size_t > > & | neighbors, | ||
std::vector< std::vector< double > > & | distances, | ||
MetricType & | metric, | ||
const bool | sameSet = false |
||
) |
Construct the RangeSearchRules object.
This is usually done from within the RangeSearch class at search time.
referenceSet | Set of reference data. |
querySet | Set of query data. |
range | Range to search for. |
neighbors | Vector to store resulting neighbors in. |
distances | Vector to store resulting distances in. |
metric | Instantiated metric. |
sameSet | If true, the query and reference set are taken to be the same, and a query point will not return itself in the results. |
|
private |
Add all the points in the given node to the results for the given query point.
If the base case has already been calculated, we make sure to not add that to the results twice.
double mlpack::range::RangeSearchRules< MetricType, TreeType >::BaseCase | ( | const size_t | queryIndex, |
const size_t | referenceIndex | ||
) |
Compute the base case between the given query point and reference point.
queryIndex | Index of query point. |
referenceIndex | Index of reference point. |
|
inline |
Get the number of base cases.
Definition at line 112 of file range_search_rules.hpp.
References mlpack::range::RangeSearchRules< MetricType, TreeType >::baseCases.
double mlpack::range::RangeSearchRules< MetricType, TreeType >::Rescore | ( | const size_t | queryIndex, |
TreeType & | referenceNode, | ||
const double | oldScore | ||
) | const |
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.
double mlpack::range::RangeSearchRules< MetricType, TreeType >::Rescore | ( | TreeType & | queryNode, |
TreeType & | referenceNode, | ||
const double | oldScore | ||
) | const |
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.
double mlpack::range::RangeSearchRules< MetricType, TreeType >::Score | ( | const size_t | queryIndex, |
TreeType & | referenceNode | ||
) |
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).
queryIndex | Index of query point. |
referenceNode | Candidate node to be recursed into. |
double mlpack::range::RangeSearchRules< MetricType, TreeType >::Score | ( | TreeType & | queryNode, |
TreeType & | referenceNode | ||
) |
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).
queryNode | Candidate query node to recurse into. |
referenceNode | Candidate reference node to recurse into. |
|
inline |
Get the number of scores (that is, calls to RangeDistance()).
Definition at line 114 of file range_search_rules.hpp.
References mlpack::range::RangeSearchRules< MetricType, TreeType >::scores.
|
inline |
Definition at line 108 of file range_search_rules.hpp.
References mlpack::range::RangeSearchRules< MetricType, TreeType >::traversalInfo.
|
inline |
Definition at line 109 of file range_search_rules.hpp.
References mlpack::range::RangeSearchRules< MetricType, TreeType >::traversalInfo.
|
private |
The number of base cases.
Definition at line 152 of file range_search_rules.hpp.
Referenced by mlpack::range::RangeSearchRules< MetricType, TreeType >::BaseCases().
|
private |
The vector the resultant neighbor distances should be stored in.
Definition at line 130 of file range_search_rules.hpp.
|
private |
The last query index.
Definition at line 139 of file range_search_rules.hpp.
|
private |
The last reference index.
Definition at line 141 of file range_search_rules.hpp.
|
private |
The instantiated metric.
Definition at line 133 of file range_search_rules.hpp.
|
private |
The vector the resultant neighbor indices should be stored in.
Definition at line 127 of file range_search_rules.hpp.
|
private |
The query set.
Definition at line 121 of file range_search_rules.hpp.
|
private |
The range of distances for which we are searching.
Definition at line 124 of file range_search_rules.hpp.
|
private |
The reference set.
Definition at line 118 of file range_search_rules.hpp.
|
private |
If true, the query and reference set are taken to be the same.
Definition at line 136 of file range_search_rules.hpp.
|
private |
THe number of scores.
Definition at line 154 of file range_search_rules.hpp.
Referenced by mlpack::range::RangeSearchRules< MetricType, TreeType >::Scores().
|
private |
Definition at line 149 of file range_search_rules.hpp.
Referenced by mlpack::range::RangeSearchRules< MetricType, TreeType >::TraversalInfo().