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
- Alphabetic
- By Inheritance
Inherited
- BallTree
- Serializable
- Product
- Equals
- BallTreeBase
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new BallTree(keys: IndexedSeq[DenseVector[Double]], values: IndexedSeq[V], leafSize: Int = 50)
Value Members
- def findMaximumInnerProducts(queryPoint: DenseVector[Double], k: Int = 1): Seq[BestMatch]
-
val
keys: IndexedSeq[DenseVector[Double]]
- Definition Classes
- BallTree → BallTreeBase
-
val
leafSize: Int
- Definition Classes
- BallTree → BallTreeBase
-
def
toString(): String
- Definition Classes
- BallTree → AnyRef → Any
-
val
values: IndexedSeq[V]
- Definition Classes
- BallTree → BallTreeBase