Package | Description |
---|---|
weka.core.neighboursearch | |
weka.core.neighboursearch.covertrees |
Modifier and Type | Method and Description |
---|---|
protected Stack<weka.core.neighboursearch.CoverTree.d_node> |
CoverTree.getCoverSet(int idx,
Stack<Stack<weka.core.neighboursearch.CoverTree.d_node>> cover_sets)
Returns a cover set for a given level/scale.
|
Modifier and Type | Method and Description |
---|---|
protected CoverTree.CoverTreeNode |
CoverTree.batch_insert(Integer p,
int max_scale,
int top_scale,
Stack<weka.core.neighboursearch.CoverTree.DistanceNode> point_set,
Stack<weka.core.neighboursearch.CoverTree.DistanceNode> consumed_set)
Creates a cover tree recursively using batch insert method.
|
protected CoverTree.CoverTreeNode |
CoverTree.batch_insert(Integer p,
int max_scale,
int top_scale,
Stack<weka.core.neighboursearch.CoverTree.DistanceNode> point_set,
Stack<weka.core.neighboursearch.CoverTree.DistanceNode> consumed_set)
Creates a cover tree recursively using batch insert method.
|
protected void |
CoverTree.batch_nearest_neighbor(int k,
CoverTree.CoverTreeNode tree_root,
CoverTree.CoverTreeNode query_root,
Stack<NearestNeighbourSearch.NeighborList> results)
Performs k-NN search for a batch of queries provided in the form
of a cover tree.
|
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.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 double |
CoverTree.compare(int p1,
int p2,
Stack<weka.core.neighboursearch.CoverTree.d_node> cover_set)
Returns the difference of two given nodes distance to
the query.
|
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_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 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 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.dist_split(Stack<weka.core.neighboursearch.CoverTree.DistanceNode> point_set,
Stack<weka.core.neighboursearch.CoverTree.DistanceNode> new_point_set,
weka.core.neighboursearch.CoverTree.DistanceNode new_point,
int max_scale)
Moves all the points in point_set covered by (the ball of) new_point
into new_point_set, based on the given scale/level.
|
protected void |
CoverTree.dist_split(Stack<weka.core.neighboursearch.CoverTree.DistanceNode> point_set,
Stack<weka.core.neighboursearch.CoverTree.DistanceNode> new_point_set,
weka.core.neighboursearch.CoverTree.DistanceNode new_point,
int max_scale)
Moves all the points in point_set covered by (the ball of) new_point
into new_point_set, based on the given scale/level.
|
protected Stack<weka.core.neighboursearch.CoverTree.d_node> |
CoverTree.getCoverSet(int idx,
Stack<Stack<weka.core.neighboursearch.CoverTree.d_node>> cover_sets)
Returns a cover set for a given level/scale.
|
protected void |
CoverTree.halfsort(Stack<weka.core.neighboursearch.CoverTree.d_node> cover_set)
Half-sorts a cover set, so that nodes nearer to the query
are at the front.
|
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.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.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 double |
CoverTree.max_set(Stack<weka.core.neighboursearch.CoverTree.DistanceNode> v)
Returns the max distance of the reference point p in current node to
it's children nodes.
|
protected void |
CoverTree.split(Stack<weka.core.neighboursearch.CoverTree.DistanceNode> point_set,
Stack<weka.core.neighboursearch.CoverTree.DistanceNode> far_set,
int max_scale)
Splits a given point_set into near and far based on the given
scale/level.
|
protected void |
CoverTree.split(Stack<weka.core.neighboursearch.CoverTree.DistanceNode> point_set,
Stack<weka.core.neighboursearch.CoverTree.DistanceNode> far_set,
int max_scale)
Splits a given point_set into near and far based on the given
scale/level.
|
protected void |
CoverTree.SWAP(int a,
int b,
Stack<weka.core.neighboursearch.CoverTree.d_node> cover_set)
Swap two nodes in a cover set.
|
Modifier and Type | Method and Description |
---|---|
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_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 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 Stack<weka.core.neighboursearch.CoverTree.d_node> |
CoverTree.getCoverSet(int idx,
Stack<Stack<weka.core.neighboursearch.CoverTree.d_node>> cover_sets)
Returns a cover set for a given level/scale.
|
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.
|
Constructor and Description |
---|
CoverTreeNode(Integer i,
double md,
double pd,
Stack<CoverTree.CoverTreeNode> childs,
int numchilds,
int s)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
void |
Stack.push(Stack<T> v,
T new_ele)
Pushes the given element onto the given
stack.
|
void |
Stack.replaceAllBy(Stack<T> s)
Replace all elements in the stack with
the elements of another given stack.
|
Copyright © 2015 University of Waikato, Hamilton, NZ. All rights reserved.