DualTreeKMeansRules< MetricType, TreeType > Class Template Reference

Public Types
typedef tree::TraversalInfo< TreeType >	TraversalInfoType

Public Member Functions
	DualTreeKMeansRules (const arma::mat &centroids, 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)
size_t	BaseCases () const
size_t &	BaseCases ()
size_t	MinimumBaseCases () const
	Get the minimum number of base cases needed for correct results for each query point. More...
double	Rescore (const size_t queryIndex, TreeType &referenceNode, const double oldScore)
double	Rescore (TreeType &queryNode, TreeType &referenceNode, const double oldScore)
double	Score (const size_t queryIndex, TreeType &referenceNode)
double	Score (TreeType &queryNode, TreeType &referenceNode)
size_t	Scores () const
size_t &	Scores ()
TraversalInfoType &	TraversalInfo ()
const TraversalInfoType &	TraversalInfo () const

Detailed Description

template

<

typename

MetricType

,

typename

TreeType

>

class mlpack::kmeans::DualTreeKMeansRules< MetricType, TreeType >

Definition at line 23 of file dual_tree_kmeans_rules.hpp.

Member Typedef Documentation

TraversalInfoType

typedef tree::TraversalInfo<TreeType> TraversalInfoType

Definition at line 47 of file dual_tree_kmeans_rules.hpp.

Constructor & Destructor Documentation

DualTreeKMeansRules()

DualTreeKMeansRules	(	const arma::mat &	centroids,
		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
	)

Member Function Documentation

BaseCase()

double BaseCase	(	const size_t	queryIndex,
		const size_t	referenceIndex
	)

BaseCases() [1/2]

size_t BaseCases ( ) const

inline

Definition at line 52 of file dual_tree_kmeans_rules.hpp.

BaseCases() [2/2]

size_t& BaseCases ( )

inline

Definition at line 53 of file dual_tree_kmeans_rules.hpp.

MinimumBaseCases()

size_t MinimumBaseCases ( ) const

inline

Get the minimum number of base cases needed for correct results for each query point.

This only matters in defeatist search mode.

Definition at line 60 of file dual_tree_kmeans_rules.hpp.

Rescore() [1/2]

double Rescore	(	const size_t	queryIndex,
		TreeType &	referenceNode,
		const double	oldScore
	)

Rescore() [2/2]

double Rescore	(	TreeType &	queryNode,
		TreeType &	referenceNode,
		const double	oldScore
	)

Score() [1/2]

double Score	(	const size_t	queryIndex,
		TreeType &	referenceNode
	)

Score() [2/2]

double Score	(	TreeType &	queryNode,
		TreeType &	referenceNode
	)

Scores() [1/2]

size_t Scores ( ) const

inline

Definition at line 55 of file dual_tree_kmeans_rules.hpp.

Scores() [2/2]

size_t& Scores ( )

inline

Definition at line 56 of file dual_tree_kmeans_rules.hpp.

TraversalInfo() [1/2]

TraversalInfoType& TraversalInfo ( )

inline

Definition at line 49 of file dual_tree_kmeans_rules.hpp.

TraversalInfo() [2/2]

const TraversalInfoType& TraversalInfo ( ) const

inline

Definition at line 50 of file dual_tree_kmeans_rules.hpp.

---

The documentation for this class was generated from the following file:

• /home/ryan/src/mlpack.org/_src/mlpack-git/src/mlpack/methods/kmeans/dual_tree_kmeans_rules.hpp