edu.uci.ics.jung.algorithms.importance
Class PageRankWithPriors<V,E>
java.lang.Object
edu.uci.ics.jung.algorithms.util.IterativeProcess
edu.uci.ics.jung.algorithms.importance.AbstractRanker<V,E>
edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker<V,E>
edu.uci.ics.jung.algorithms.importance.PageRank<V,E>
edu.uci.ics.jung.algorithms.importance.PageRankWithPriors<V,E>
- All Implemented Interfaces:
- IterativeContext
Deprecated. As of JUNG 2.0 beta, replaced with PageRankWithPriors
.
public class PageRankWithPriors<V,E>
- extends PageRank<V,E>
Algorithm that extends the PageRank algorithm by incorporating root nodes (priors). Whereas in PageRank
the importance of a node is implicitly computed relative to all nodes in the graph now importance
is computed relative to the specified root nodes.
Note: This algorithm uses the same key as PageRank for storing rank sccores
A simple example of usage is:
PageRankWithPriors ranker = new PageRankWithPriors(someGraph,0.3,1,rootSet,null);
ranker.evaluate();
ranker.printRankings();
Running time: O(|E|*I) where |E| is the number of edges and I is the number of iterations until convergence
- Author:
- Scott White
- See Also:
- "Algorithms for Estimating Relative Importance in Graphs by Scott White and Padhraic Smyth, 2003"
Fields inherited from class edu.uci.ics.jung.algorithms.importance.PageRank |
KEY |
Methods inherited from class edu.uci.ics.jung.algorithms.importance.AbstractRanker |
assignDefaultEdgeTransitionWeights, getEdgeRankScore, getEdgeRankScore, getEdgeRankScores, getEdgeRankScores, getEdgeWeight, getEdgeWeights, getGraph, getRankings, getRankScores, getVertexCount, getVertexRankScore, getVertexRankScore, getVertexRankScores, getVertexRankScores, getVertices, initialize, isRankingEdges, isRankingNodes, normalizeEdgeTransitionWeights, normalizeRankings, onFinalize, printRankings, removeEdgeRankScore, removeEdgeRankScore, removeVertexRankScore, removeVertexRankScore, setEdgeRankScore, setEdgeRankScore, setEdgeWeight, setEdgeWeights, setNormalizeRankings, setRemoveRankScoresOnFinalize, setVertexRankScore, setVertexRankScore |
Methods inherited from class edu.uci.ics.jung.algorithms.util.IterativeProcess |
done, evaluate, getDesiredPrecision, getIterations, getMaximumIterations, getPrecision, getStatus, hasConverged, initializeIterations, relativePrecision, setDesiredPrecision, setMaximumIterations, setPrecision |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
PageRankWithPriors
public PageRankWithPriors(DirectedGraph<V,E> graph,
double beta,
Set<V> priors,
Map<E,Number> edgeWeights)
- Deprecated.
- Constructs an instance of the ranker.
- Parameters:
graph
- the graph whose nodes are being rankedbeta
- the prior weight to put on the root nodespriors
- the set of root nodesedgeWeights
- the user datum key associated with any user-defined weights. If there are none,
null should be passed in (and default weights of 1/outdegree will be used).
initializePriorWeights
protected void initializePriorWeights()
- Deprecated.
reset
public void reset()
- Deprecated.
- Overrides:
reset
in class PageRank<V,E>
Copyright © 2008 null. All Rights Reserved.