Uses of Class
elki.clustering.kmeans.KDTreePruningKMeans.KDNode

Packages that use KDTreePruningKMeans.KDNode

Package	Description
elki.clustering.kmeans	K-means clustering and variations.

Uses of KDTreePruningKMeans.KDNode in elki.clustering.kmeans

Fields in elki.clustering.kmeans declared as KDTreePruningKMeans.KDNode

Modifier and Type	Field	Description
(package private) KDTreePruningKMeans.KDNode	KDTreePruningKMeans.KDNode.leftChild	Left child node
(package private) KDTreePruningKMeans.KDNode	KDTreePruningKMeans.KDNode.rightChild	Right child node
protected KDTreePruningKMeans.KDNode	KDTreePruningKMeans.Instance.root	The root node of the tree

Methods in elki.clustering.kmeans that return KDTreePruningKMeans.KDNode

Modifier and Type	Method	Description
protected KDTreePruningKMeans.KDNode	KDTreePruningKMeans.Instance.buildTreeBoundedMidpoint(Relation<? extends NumberVector> relation, int left, int right, VectorUtil.SortDBIDsBySingleDimension comp)	Build the k-d-tree using bounded midpoint splitting.
protected KDTreePruningKMeans.KDNode	KDTreePruningKMeans.Instance.buildTreeMedian(Relation<? extends NumberVector> relation, int left, int right, VectorUtil.SortDBIDsBySingleDimension comp)	Build the k-d-tree using median splitting.
protected KDTreePruningKMeans.KDNode	KDTreePruningKMeans.Instance.buildTreeMidpoint(Relation<? extends NumberVector> relation, int left, int right)	Build the k-d-tree using midpoint splitting.
protected KDTreePruningKMeans.KDNode	KDTreePruningKMeans.Instance.buildTreeSSQ(Relation<? extends NumberVector> relation, int left, int right, VectorUtil.SortDBIDsBySingleDimension comp)	Build the k-d-tree using a variance-based splitting strategy.

Methods in elki.clustering.kmeans with parameters of type KDTreePruningKMeans.KDNode

Modifier and Type	Method	Description
protected int	KDTreeFilteringKMeans.Instance.pruning(KDTreePruningKMeans.KDNode u, int alive)
protected int	KDTreePruningKMeans.Instance.pruning(KDTreePruningKMeans.KDNode u, int alive)	The pruning algorithm.
protected int	KDTreePruningKMeans.Instance.traversal(KDTreePruningKMeans.KDNode u, int alive)	The tree traversal algorithm.