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
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
val
dim: Int
- Attributes
- protected
- Definition Classes
- BallTreeBase
-
val
epsilon: Double
- Attributes
- protected
- Definition Classes
- BallTreeBase
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def findMaximumInnerProducts(queryPoint: DenseVector[Double], k: Int = 1): Seq[BestMatch]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
val
keys: IndexedSeq[DenseVector[Double]]
- Definition Classes
- BallTree → BallTreeBase
-
val
leafSize: Int
- Definition Classes
- BallTree → BallTreeBase
-
def
makeBallTree(pointIdx: Seq[Int]): Node
- Attributes
- protected
- Definition Classes
- BallTreeBase
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
val
pointIdx: Range
- Attributes
- protected
- Definition Classes
- BallTreeBase
-
val
randomIntGenerator: Random
- Attributes
- protected
- Definition Classes
- BallTreeBase
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- BallTree → AnyRef → Any
-
def
upperBoundMaximumInnerProduct(query: Query, node: Node): Double
- Attributes
- protected
- Definition Classes
- BallTreeBase
-
val
values: IndexedSeq[V]
- Definition Classes
- BallTree → BallTreeBase
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()