Class

com.twitter.cassovary.graph.bipartite

IterativeLinkAnalyzer

Related Doc: package bipartite

Permalink

class IterativeLinkAnalyzer extends AnyRef

Iteratively analyze links in a bipartite graph.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. IterativeLinkAnalyzer
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new IterativeLinkAnalyzer(graphUtils: GraphUtils[Node], resetProbOnLeft: Double, resetProbOnRight: Double, numTopContributors: Int)

    Permalink

    graphUtils

    GraphUtils encapsulating the underlying graph

    resetProbOnLeft

    reset probability when iterating from left to right

    resetProbOnRight

    reset probability when iterating from right to left

    numTopContributors

    The number of contributors (reasons) to be kept for each score

Type Members

  1. case class NodeInfo(node: Node, initialIterationWeight: Double, weight: Double, numNeighbors: Int) extends Ordered[NodeInfo] with Product with Serializable

    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 analyze(leftNodes: Seq[SuppliedNodeInfo], numIterations: Int, neighborsProvider: (Node) ⇒ Seq[Int], sortOutputByScore: Boolean): (List[(Int, Double, Seq[Int])], List[(Int, Double, Seq[Int])])

    Permalink

    Carries out link analysis on a bipartite graph.

    Carries out link analysis on a bipartite graph.

    neighborsProvider

    A function providing the neighbors of a node on the left

    sortOutputByScore

    A boolean variable indicating if the output of the analysis should be sorted

  5. def analyze(leftNodes: Seq[SuppliedNodeInfo], numIterations: Int, neighborsProvider: (Node) ⇒ Seq[Int]): (List[(Int, Double, Seq[Int])], List[(Int, Double, Seq[Int])])

    Permalink

    Carries out link analysis on a bipartite graph, by default sort its output

    Carries out link analysis on a bipartite graph, by default sort its output

    neighborsProvider

    A function providing the neighbors of a node on the left

  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. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  18. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  19. final def wait(): Unit

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped