|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectedu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer<V,E,S>
edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors<V,E,S>
V - the vertex typeE - the edge typeS - the score typepublic abstract class AbstractIterativeScorerWithPriors<V,E,S>
An abstract class for iterative random-walk-based vertex scoring algorithms that have a fixed probability, for each vertex, of 'jumping' to that vertex at each step in the algorithm (rather than following a link out of that vertex).
| Field Summary | |
|---|---|
protected double |
alpha
The probability of making a 'jump' at each step. |
protected |
vertex_priors
The prior probability of each vertex being visited on a given 'jump' (non-link-following) step. |
| Fields inherited from class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer |
|---|
edge_weights, graph, hyperedges_are_self_loops, max_delta, max_iterations, output_reversed, tolerance, total_iterations |
| Constructor Summary | |
|---|---|
AbstractIterativeScorerWithPriors(Hypergraph<V,E> g,
Creates an instance for the specified graph, edge weights, vertex priors, and jump probability. |
|
AbstractIterativeScorerWithPriors(Hypergraph<V,E> g,
Creates an instance for the specified graph, vertex priors, and jump probability, with edge weights specified by the subclass. |
|
| Method Summary | |
|---|---|
double |
getAlpha()
Returns the probability of making a 'jump' (non-link-following step). |
protected S |
getVertexPrior(V v)
Returns the prior probability for v. |
|
getVertexPriors()
Returns a Transformer which maps each vertex to its prior probability. |
void |
initialize()
Initializes the state of this instance. |
| Methods inherited from class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer |
|---|
acceptDisconnectedGraph, afterStep, collectDisappearingPotential, done, evaluate, getAdjustedIncidentCount, getCurrentValue, getEdgeWeight, getEdgeWeights, getIterations, getMaxIterations, getOutputValue, getTolerance, getVertexScore, isDisconnectedGraphOK, setCurrentValue, setEdgeWeights, setHyperedgesAreSelfLoops, setMaxIterations, setOutputValue, setTolerance, step, swapOutputForCurrent, update, updateMaxDelta |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Methods inherited from interface edu.uci.ics.jung.algorithms.scoring.VertexScorer |
|---|
getVertexScore |
| Field Detail |
|---|
protectedvertex_priors
protected double alpha
| Constructor Detail |
|---|
public AbstractIterativeScorerWithPriors(Hypergraph<V,E> g,
edge_weights,
vertex_priors,
double alpha)
g - the graph whose vertices are to be assigned scoresedge_weights - the edge weights to use in the score assignmentvertex_priors - the prior probabilities of each vertex being 'jumped' toalpha - the probability of making a 'jump' at each step
public AbstractIterativeScorerWithPriors(Hypergraph<V,E> g,
vertex_priors,
double alpha)
g - the graph whose vertices are to be assigned scoresvertex_priors - the prior probabilities of each vertex being 'jumped' toalpha - the probability of making a 'jump' at each step| Method Detail |
|---|
public void initialize()
initialize in class AbstractIterativeScorer<V,E,S>protected S getVertexPrior(V v)
v.
v - the vertex whose prior probability is being queried
vpublicgetVertexPriors()
public double getAlpha()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||