Packages

class VPIndex[T, U] extends Index[T, U]

A VP index to compute nearest neighbor queries. This is the metric space equivalent of a k-d tree. Given a query value the index performs a best first search through the index until the guaranteed k nearest neighbors are found. See Foundations of Multidimensional and Metric Data Structures by Hanan Samet for more details

T

The type of the parent

U

The type of the decision

Linear Supertypes
Index[T, U], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. VPIndex
  2. Index
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new VPIndex(stratMap: Map[(T, U), DecisionSample], capacity: Int)(implicit arg0: (T) ⇒ Distance[T])

    stratMap

    A mapping from parent/decision values to observed utilities. This is output by a DecisionAlgorithm.

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  10. def getNN(parent: T, num: Int): List[(Double, U, DecisionSample)]

    Return the k nearest neighbor samples from the parent value

    Return the k nearest neighbor samples from the parent value

    Definition Classes
    VPIndexIndex
  11. def getNNDebug(parent: T, num: Int): Iterable[(Double, Set[(U, DecisionSample)])]

    The debug version of the getNN returns the raw data from the index node.

    The debug version of the getNN returns the raw data from the index node.

    Definition Classes
    VPIndexIndex
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. final def notify(): Unit
    Definition Classes
    AnyRef
  16. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  17. def size: Int

    Get the size of the index.

    Get the size of the index.

    Definition Classes
    Index
  18. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  19. def toString(): String
    Definition Classes
    AnyRef → Any
  20. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Index[T, U]

Inherited from AnyRef

Inherited from Any

Ungrouped