|
mlpack
|
A dual-tree traversal Rules class for cleaning used trees before performing kernel density estimation. More...
#include <kde_rules.hpp>
Public Types | |
| typedef tree::TraversalInfo< TreeType > | TraversalInfoType |
Public Member Functions | |
| KDECleanRules () | |
| Construct KDECleanRules. | |
| double | BaseCase (const size_t, const size_t) |
| Base Case. More... | |
| double | Score (const size_t, TreeType &referenceNode) |
| SingleTree Score. More... | |
| double | Rescore (const size_t, TreeType &, const double oldScore) const |
| SingleTree Rescore. | |
| double | Score (TreeType &queryNode, TreeType &referenceNode) |
| Dual-Tree Score. More... | |
| double | Rescore (TreeType &, TreeType &, const double oldScore) const |
| Dual-Tree Rescore. | |
| const TraversalInfoType & | TraversalInfo () const |
| Get traversal information. | |
| TraversalInfoType & | TraversalInfo () |
| Modify traversal information. | |
A dual-tree traversal Rules class for cleaning used trees before performing kernel density estimation.
|
inline |
Base Case.
Clean rules base case.
|
inline |
SingleTree Score.
Clean rules single-tree score.
|
inline |
Dual-Tree Score.
Clean rules double-tree score.
1.8.13