Class

com.soundcloud.lsh

QueryNearestNeighbours

Related Doc: package lsh

Permalink

class QueryNearestNeighbours extends QueryJoiner with Serializable

Brute force O(size(query) * size(catalog)) method to compute exact nearest neighbours for rows in the query matrix. As this is a very expensive computation, additional sample parameters may be passed such that neighbours are just computed for a random fraction of the data set.

Linear Supertypes
Serializable, Serializable, QueryJoiner, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. QueryNearestNeighbours
  2. Serializable
  3. Serializable
  4. QueryJoiner
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new QueryNearestNeighbours(distance: VectorDistance, threshold: Double, queryFraction: Double, catalogFraction: Double)

    Permalink

    distance

    a function defining a metric over a vector space

    threshold

    pairs that are >= to the distance are discarded

    queryFraction

    compute for the random fraction of queries

    catalogFraction

    compute for the random fraction of the catalog

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. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  12. def join(queryMatrix: IndexedRowMatrix, catalogMatrix: IndexedRowMatrix): CoordinateMatrix

    Permalink

    Find the k nearest neighbours in catalogMatrix for each entry in queryMatrix.

    Find the k nearest neighbours in catalogMatrix for each entry in queryMatrix. Implementations may be either exact or approximate.

    queryMatrix

    a row oriented matrix. Each row in the matrix represents an item in the data set. Items are identified by their matrix index.

    catalogMatrix

    a row oriented matrix. Each row in the matrix represents an item in the data set. Items are identified by their matrix index.

    returns

    a similarity matrix with MatrixEntry(queryA, catalogB, similarity).

    Definition Classes
    QueryNearestNeighboursQueryJoiner
  13. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  16. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  17. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  18. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long): Unit

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

Inherited from Serializable

Inherited from Serializable

Inherited from QueryJoiner

Inherited from AnyRef

Inherited from Any

Ungrouped