V
- the vertex typeE
- the edge typeS
- the score typepublic abstract class AbstractIterativeScorerWithPriors<V,E,S> extends AbstractIterativeScorer<V,E,S> implements VertexScorer<V,S>
Modifier and Type | Field and Description |
---|---|
protected double |
alpha
The probability of making a 'jump' at each step.
|
protected com.google.common.base.Function<? super V,? extends S> |
vertex_priors
The prior probability of each vertex being visited on a given
'jump' (non-link-following) step.
|
edge_weights, graph, hyperedges_are_self_loops, max_delta, max_iterations, output_reversed, tolerance, total_iterations
Constructor and Description |
---|
AbstractIterativeScorerWithPriors(Hypergraph<V,E> g,
com.google.common.base.Function<? super E,? extends Number> edge_weights,
com.google.common.base.Function<? super V,? extends S> vertex_priors,
double alpha)
Creates an instance for the specified graph, edge weights, vertex
priors, and jump probability.
|
AbstractIterativeScorerWithPriors(Hypergraph<V,E> g,
com.google.common.base.Function<V,? extends S> vertex_priors,
double alpha)
Creates an instance for the specified graph, vertex priors, and jump
probability, with edge weights specified by the subclass.
|
Modifier and Type | Method and Description |
---|---|
double |
getAlpha()
Returns the probability of making a 'jump' (non-link-following step).
|
protected S |
getVertexPrior(V v)
Returns the prior probability for
v . |
com.google.common.base.Function<? super V,? extends S> |
getVertexPriors()
Returns a Function which maps each vertex to its prior probability.
|
void |
initialize()
Initializes the state of this instance.
|
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
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
getVertexScore
protected com.google.common.base.Function<? super V,? extends S> vertex_priors
protected double alpha
public AbstractIterativeScorerWithPriors(Hypergraph<V,E> g, com.google.common.base.Function<? super E,? extends Number> edge_weights, com.google.common.base.Function<? super V,? extends S> 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 steppublic AbstractIterativeScorerWithPriors(Hypergraph<V,E> g, com.google.common.base.Function<V,? extends S> 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 steppublic void initialize()
initialize
in class AbstractIterativeScorer<V,E,S>
protected S getVertexPrior(V v)
v
.v
- the vertex whose prior probability is being queriedv
public com.google.common.base.Function<? super V,? extends S> getVertexPriors()
public double getAlpha()
Copyright © 2015. All rights reserved.