Class

com.twitter.scalding.mathematics

ExactInCosine

Related Doc: package mathematics

Permalink

class ExactInCosine[N] extends TypedSimilarity[N, InDegree, Double]

This algothm is just matrix multiplication done by hand to make it clearer when we do the sampling implementation

Source
TypedSimilarity.scala
Linear Supertypes
TypedSimilarity[N, InDegree, Double], Serializable, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ExactInCosine
  2. TypedSimilarity
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ExactInCosine(reducers: Int = 1)(implicit nodeOrdering: Ordering[N])

    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. def apply(graph: typed.TypedPipe[Edge[N, InDegree]], smallpred: (N) ⇒ Boolean, bigpred: (N) ⇒ Boolean): typed.TypedPipe[Edge[N, Double]]

    Permalink

    Given a TypedPipe of edges, and a predicate for a smaller group (smallpred) of nodes and a bigger group (bigpred), compute the similarity between each item in the two sets The Edge.from nodes in the result will all satisfy smallpred, and the Edge.to will all satisfy bigpred.

    Given a TypedPipe of edges, and a predicate for a smaller group (smallpred) of nodes and a bigger group (bigpred), compute the similarity between each item in the two sets The Edge.from nodes in the result will all satisfy smallpred, and the Edge.to will all satisfy bigpred. It is more efficient if you keep the smallpred set smaller.

    Definition Classes
    ExactInCosine → TypedSimilarity

  5. def apply(g: typed.TypedPipe[Edge[N, InDegree]]): typed.TypedPipe[Edge[N, Double]]

    Permalink
    Definition Classes
    TypedSimilarity

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  7. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  12. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  15. implicit val nodeOrdering: Ordering[N]

    Permalink
    Definition Classes
    ExactInCosine → TypedSimilarity

  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  19. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  20. final def wait(): Unit

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

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

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

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

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

Inherited from TypedSimilarity[N, InDegree, Double]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped