edu.uci.ics.jung.algorithms.scoring

Class HITSWithPriors<V,E>

java.lang.Object

edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer<V,E,S>

edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors<V,E,HITS.Scores>

edu.uci.ics.jung.algorithms.scoring.HITSWithPriors<V,E>

All Implemented Interfaces:

VertexScorer<V,HITS.Scores>, IterativeContext

Direct Known Subclasses:

HITS

public class HITSWithPriors<V,E>
extends AbstractIterativeScorerWithPriors<V,E,HITS.Scores>

A generalization of HITS that permits non-uniformly-distributed random jumps. The 'vertex_priors' (that is, prior probabilities for each vertex) may be thought of as the fraction of the total 'potential' (hub or authority score) that is assigned to that vertex out of the portion that is assigned according to random jumps.

See Also:

"Algorithms for Estimating Relative Importance in Graphs by Scott White and Padhraic Smyth, 2003"

Constructor Summary

Constructors

Constructor and Description
HITSWithPriors(Hypergraph<V,E> g, com.google.common.base.Function<E,? extends java.lang.Number> edge_weights, com.google.common.base.Function<V,HITS.Scores> vertex_priors, double alpha) Creates an instance for the specified graph, edge weights, vertex prior probabilities, and random jump probability (alpha).
HITSWithPriors(Hypergraph<V,E> g, com.google.common.base.Function<V,HITS.Scores> vertex_priors, double alpha) Creates an instance for the specified graph, vertex priors, and random jump probability (alpha).

Method Summary

Methods inherited from class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors

getAlpha, getVertexPriors, initialize

Methods inherited from class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer

acceptDisconnectedGraph, done, evaluate, getEdgeWeights, getIterations, getMaxIterations, getTolerance, getVertexScore, isDisconnectedGraphOK, setEdgeWeights, setHyperedgesAreSelfLoops, setMaxIterations, setTolerance, step

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface edu.uci.ics.jung.algorithms.scoring.VertexScorer

getVertexScore

Constructor Detail

HITSWithPriors

public HITSWithPriors(Hypergraph<V,E> g,
                      com.google.common.base.Function<E,? extends java.lang.Number> edge_weights,
                      com.google.common.base.Function<V,HITS.Scores> vertex_priors,
                      double alpha)

Creates an instance for the specified graph, edge weights, vertex prior probabilities, and random jump probability (alpha).

Parameters:

g - the input graph

edge_weights - the edge weights

vertex_priors - the prior probability for each vertex

alpha - the probability of a random jump at each step

HITSWithPriors

public HITSWithPriors(Hypergraph<V,E> g,
                      com.google.common.base.Function<V,HITS.Scores> vertex_priors,
                      double alpha)

Creates an instance for the specified graph, vertex priors, and random jump probability (alpha). The edge weights default to 1.0.

Parameters:

g - the input graph

vertex_priors - the prior probability for each vertex

alpha - the probability of a random jump at each step