com.twitter.cassovary.graph.bipartite

IterativeLinkAnalyzer

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
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

    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

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

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

    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

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

    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

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  9. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  11. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  12. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  20. def toString(): String

    Definition Classes
    AnyRef → Any

  21. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped