Field Detail

• EUCLIDEAN

  public static final String EUCLIDEAN

  See Also:

  Constant Field Values

Constructor Detail

• VPTree

  protected VPTree()

• VPTree

  public VPTree(INDArray points,
                boolean invert)

  Parameters:

  points -

  invert -

• VPTree

  public VPTree(INDArray points,
                boolean invert,
                int workers)

  Parameters:

  points -

  invert -

  workers - number of parallel workers for tree building (increases memory requirements!)

• VPTree

  public VPTree(INDArray items,
                String similarityFunction,
                boolean invert)

  Parameters:

  items - the items to use

  similarityFunction - the similarity function to use

  invert - whether to invert the distance (similarity functions have different min/max objectives)

• VPTree

  public VPTree(List<DataPoint> items,
                String similarityFunction,
                int workers,
                boolean invert)

  Parameters:

  items - the items to use

  similarityFunction - the similarity function to use

  workers - number of parallel workers for tree building (increases memory requirements!)

  invert - whether to invert the metric (different optimization objective)

• VPTree

  public VPTree(INDArray items,
                String similarityFunction)

  Parameters:

  items -

  similarityFunction -

• VPTree

  public VPTree(INDArray items,
                String similarityFunction,
                int workers,
                boolean invert)

  Parameters:

  items -

  similarityFunction -

  workers - number of parallel workers for tree building (increases memory requirements!)

  invert -

• VPTree

  public VPTree(List<DataPoint> items,
                String similarityFunction)

  Parameters:

  items -

  similarityFunction -

• VPTree

  public VPTree(INDArray items)

  Parameters:

  items -

• VPTree

  public VPTree(List<DataPoint> items)

  Parameters:

  items -

Method Detail

• buildFromData

  public static INDArray buildFromData(List<DataPoint> data)

  Create an ndarray from the datapoints

  Parameters:

  data -

  Returns:

• calcDistancesRelativeTo

  public void calcDistancesRelativeTo(INDArray items,
                                      INDArray basePoint,
                                      INDArray distancesArr)

  Parameters:

  basePoint -

  distancesArr -

• calcDistancesRelativeTo

  public void calcDistancesRelativeTo(INDArray basePoint,
                                      INDArray distancesArr)

• distance

  public double distance(INDArray arr1,
                         INDArray arr2)

  Euclidean distance

  Returns:

  the distance between the two points

• search

  public void search(@NonNull
                     @NonNull INDArray target,
                     int k,
                     List<DataPoint> results,
                     List<Double> distances)

• search

  public void search(@NonNull
                     @NonNull INDArray target,
                     int k,
                     List<DataPoint> results,
                     List<Double> distances,
                     boolean filterEqual)

• search

  public void search(@NonNull
                     @NonNull INDArray target,
                     int k,
                     List<DataPoint> results,
                     List<Double> distances,
                     boolean filterEqual,
                     boolean dropEdge)

  Parameters:

  target -

  k -

  results -

  distances -

• search

  public void search(VPTree.Node node,
                     INDArray target,
                     int k,
                     PriorityQueue<HeapObject> pq,
                     double cTau)

  Parameters:

  node -

  target -

  k -

  pq -