com.twitter.cassovary.algorithms.linkanalysis

Hits

Related Doc: package linkanalysis

class Hits extends LinkAnalysis[HitsIterationState]

Class for performing Hits algorithm. Hits is a link analysis algorithm that returns two values characterizing each node. Each node receives both a hub value and an authority value. A node that is characterized by a large hub value is one that has many high quality outbound connections to other nodes, while a node that is characterized by a large authority value has inbound connections from high quality hub nodes.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hits
  2. LinkAnalysis
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Hits(graph: DirectedGraph[Node], params: HitsParams = HitsParams())

    params

    The set of all parameters passed into our algorithm

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. def defaultInitialState: HitsIterationState

    Provides default initial start values for our algorithms.

    Provides default initial start values for our algorithms.

    returns

    An default starting iteration.

    Attributes
    protected
    Definition Classes
    HitsLinkAnalysis
  7. def deltaOfArrays(a: Array[Double], b: Array[Double], t1: Boolean = true): Double

    Calculate the error between two arrays using either the T1 error or the T2 error.

    Calculate the error between two arrays using either the T1 error or the T2 error. This is a convenience method.

    t1

    Flag true to calculate the T1 error (the sum of absolute differences between two arrays). Flag false to calculate the T2 error (the sum of the squared differences between two arrays).

    Attributes
    protected
    Definition Classes
    LinkAnalysis
  8. def efficientNeighborCount(node: Node): Int

    Attributes
    protected
    Definition Classes
    LinkAnalysis
  9. def efficientNeighbors(node: Node): Seq[Int]

    Attributes
    protected
    Definition Classes
    LinkAnalysis
  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. val isInStored: Boolean

    Attributes
    protected
    Definition Classes
    LinkAnalysis
  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  17. def iterate(prevIteration: HitsIterationState): HitsIterationState

    Run a single iteration through our algorithm.

    Run a single iteration through our algorithm.

    returns

    A new iteration.

    Definition Classes
    HitsLinkAnalysis
  18. val log: Logger

    Attributes
    protected
    Definition Classes
    LinkAnalysis
  19. val maxIterations: Option[Int]

    Attributes
    protected
    Definition Classes
    LinkAnalysis
  20. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  21. final def notify(): Unit

    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  23. def postRun(finalState: HitsIterationState): HitsIterationState

    Run final processing of the state.

    Run final processing of the state. Unless the method is overridden, it will just return the final state. If normalization needs to happen upon convergence, this method is the ideal location for such

    finalState
    returns

    Definition Classes
    HitsLinkAnalysis
  24. def run(init: HitsIterationState = defaultInitialState): HitsIterationState

    Run the algorithm to completion according to the parameters passed on instantiation.

    Run the algorithm to completion according to the parameters passed on instantiation.

    init

    The starting point of the iteration. If no iteration is given, the default start is assumed

    returns

    The final iteration.

    Definition Classes
    LinkAnalysis
  25. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  26. def toString(): String

    Definition Classes
    AnyRef → Any
  27. val tolerance: Double

    Attributes
    protected
    Definition Classes
    LinkAnalysis
  28. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped