Class

com.microsoft.ml.spark.nn

BallTree

Related Doc: package nn

Permalink

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
Serializable, Product, Equals, BallTreeBase[V], Serializable, AnyRef, Any
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)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. val dim: Int

    Permalink
    Attributes
    protected
    Definition Classes
    BallTreeBase

  7. val epsilon: Double

    Permalink
    Attributes
    protected
    Definition Classes
    BallTreeBase

  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  10. def findMaximumInnerProducts(queryPoint: DenseVector[Double], k: Int = 1): Seq[BestMatch]

    Permalink

  11. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  13. val keys: IndexedSeq[DenseVector[Double]]

    Permalink
    Definition Classes
    BallTree → BallTreeBase

  14. val leafSize: Int

    Permalink
    Definition Classes
    BallTree → BallTreeBase

  15. def makeBallTree(pointIdx: Seq[Int]): Node

    Permalink
    Attributes
    protected
    Definition Classes
    BallTreeBase

  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. val pointIdx: Range

    Permalink
    Attributes
    protected
    Definition Classes
    BallTreeBase

  20. val randomIntGenerator: Random

    Permalink
    Attributes
    protected
    Definition Classes
    BallTreeBase

  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  22. def toString(): String

    Permalink
    Definition Classes
    BallTree → AnyRef → Any

  23. def upperBoundMaximumInnerProduct(query: Query, node: Node): Double

    Permalink
    Attributes
    protected
    Definition Classes
    BallTreeBase

  24. val values: IndexedSeq[V]

    Permalink
    Definition Classes
    BallTree → BallTreeBase

  25. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  26. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  27. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from BallTreeBase[V]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped