LinkAnalysis

Instance Constructors

new LinkAnalysis(graph: DirectedGraph[Node], params: Params, modelName: String)

params
The set of all parameters passed into our algorithm
modelName
This must be provided by all subclasses for logging purposes. This should not be left up to the user to define. This must be provided by the implementer.

Abstract Value Members

abstract def defaultInitialState: T

Provides default initial start values for our algorithms.
Provides default initial start values for our algorithms.
returns
An default starting iteration.

Attributes
protected
abstract def iterate(currState: T): T

Run a single iteration through our algorithm.
Run a single iteration through our algorithm.
currState
The starting iteration that our algorithm will be applied to.
returns
A new iteration.

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
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
def efficientNeighborCount(node: Node): Int

Attributes
protected
def efficientNeighbors(node: Node): Seq[Int]

Attributes
protected
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
val isInStored: Boolean

Attributes
protected
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val log: Logger

Attributes
protected
val maxIterations: Option[Int]

Attributes
protected
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def postRun(finalState: T): T

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
def run(init: T = defaultInitialState): T

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.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
val tolerance: Double

Attributes
protected
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package linkanalysis

abstract class LinkAnalysis[T <: IterationState] extends AnyRef

Instance Constructors

new LinkAnalysis(graph: DirectedGraph[Node], params: Params, modelName: String)

Abstract Value Members

abstract def defaultInitialState: T

abstract def iterate(currState: T): T

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def deltaOfArrays(a: Array[Double], b: Array[Double], t1: Boolean = true): Double

def efficientNeighborCount(node: Node): Int

def efficientNeighbors(node: Node): Seq[Int]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

val isInStored: Boolean

final def isInstanceOf[T0]: Boolean

val log: Logger

val maxIterations: Option[Int]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def postRun(finalState: T): T

def run(init: T = defaultInitialState): T

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

def toString(): String

val tolerance: Double

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped