Packages

case class BallTree[V](keys: IndexedSeq[DenseVector[Double]], values: IndexedSeq[V], leafSize: Int = 50) extends Serializable with BallTreeBase[V] with Product with Serializable

Performs fast lookups of nearest neighbors using the Ball Tree algorithm for space partitioning

Note that this code borrows heavily from https://github.com/felixmaximilian/mips

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BallTree
  2. Serializable
  3. Product
  4. Equals
  5. BallTreeBase
  6. Serializable
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BallTree(keys: IndexedSeq[DenseVector[Double]], values: IndexedSeq[V], leafSize: Int = 50)

Value Members

  1. def findMaximumInnerProducts(queryPoint: DenseVector[Double], k: Int = 1): Seq[BestMatch]
  2. val keys: IndexedSeq[DenseVector[Double]]
    Definition Classes
    BallTreeBallTreeBase
  3. val leafSize: Int
    Definition Classes
    BallTreeBallTreeBase
  4. def toString(): String
    Definition Classes
    BallTree → AnyRef → Any
  5. val values: IndexedSeq[V]
    Definition Classes
    BallTreeBallTreeBase