Package | Description |
---|---|
weka.core.neighboursearch |
Modifier and Type | Method and Description |
---|---|
protected void |
CoverTree.brute_nearest(int k,
CoverTree.CoverTreeNode query,
Stack<weka.core.neighboursearch.CoverTree.d_node> zero_set,
CoverTree.MyHeap upper_k,
Stack<NearestNeighbourSearch.NeighborList> results)
Does a brute force NN search on the nodes in the given zero set.
|
protected void |
CoverTree.copy_cover_sets(CoverTree.CoverTreeNode query_chi,
CoverTree.MyHeap new_upper_k,
Stack<Stack<weka.core.neighboursearch.CoverTree.d_node>> cover_sets,
Stack<Stack<weka.core.neighboursearch.CoverTree.d_node>> new_cover_sets,
int current_scale,
int max_scale)
Copies the contents of one set of cover sets to the other.
|
protected void |
CoverTree.copy_zero_set(CoverTree.CoverTreeNode query_chi,
CoverTree.MyHeap new_upper_k,
Stack<weka.core.neighboursearch.CoverTree.d_node> zero_set,
Stack<weka.core.neighboursearch.CoverTree.d_node> new_zero_set)
Copies the contents of one zero set to the other.
|
protected int |
CoverTree.descend(CoverTree.CoverTreeNode query,
CoverTree.MyHeap upper_k,
int current_scale,
int max_scale,
Stack<Stack<weka.core.neighboursearch.CoverTree.d_node>> cover_sets,
Stack<weka.core.neighboursearch.CoverTree.d_node> zero_set)
This functions adds nodes for inspection at the next level during NN
search.
|
protected void |
CoverTree.internal_batch_nearest_neighbor(int k,
CoverTree.CoverTreeNode query_node,
Stack<Stack<weka.core.neighboursearch.CoverTree.d_node>> cover_sets,
Stack<weka.core.neighboursearch.CoverTree.d_node> zero_set,
int current_scale,
int max_scale,
CoverTree.MyHeap upper_k,
Stack<NearestNeighbourSearch.NeighborList> results)
Performs a recursive k-NN search for a given batch of queries provided in the
form of a cover tree.
|
protected void |
CoverTree.setter(CoverTree.MyHeap heap,
double upper_bound,
int k)
Initializes a heap with k values of the the given upper_bound.
|
protected void |
CoverTree.update(CoverTree.MyHeap upper_bound,
double new_bound)
Replaces the current top/max value in the heap with the new one.
|
Copyright © 2015 University of Waikato, Hamilton, NZ. All rights reserved.