|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.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.HITSWithPriors<V,E>
HITSWithPriors
.
public class HITSWithPriors<V,E>
Algorithm that extends the HITS algorithm by incorporating root nodes (priors). Whereas in HITS 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.
A simple example of usage is:
HITSWithPriors ranker = new HITSWithPriors(someGraph,0.3,rootSet); ranker.evaluate(); ranker.printRankings();
Running time: O(|V|*I) where |V| is the number of vertices and I is the number of iterations until convergence
Field Summary | |
---|---|
protected static String |
AUTHORITY_KEY
Deprecated. |
protected static String |
HUB_KEY
Deprecated. |
Fields inherited from class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker |
---|
priorRankScoreMap |
Fields inherited from class edu.uci.ics.jung.algorithms.importance.AbstractRanker |
---|
edgeRankScores, vertexRankScores |
Constructor Summary | |
---|---|
HITSWithPriors(Graph<V,E> graph,
boolean useAuthorityForRanking,
double bias,
Set<V> priors,
String edgeWeightKey)
Deprecated. More specialized constructor where the type of importance can be specified. |
|
HITSWithPriors(Graph<V,E> graph,
double bias,
Set<V> priors)
Deprecated. Constructs an instance of the ranker where the type of importance that is associated with the rank score is the node's importance as an authority. |
Method Summary | |
---|---|
protected void |
finalizeIterations()
Deprecated. Cleans up all of the prior rank scores on finalize. |
protected double |
getInEdgeWeight(E e)
Deprecated. |
protected double |
getPreviousAuthorityScore(V v)
Deprecated. |
protected double |
getPreviousHubScore(V v)
Deprecated. |
String |
getRankScoreKey()
Deprecated. the user datum key used to store the rank scores |
protected void |
initialize(Graph<V,E> g,
String edgeWeightKeyName)
Deprecated. |
protected void |
setInEdgeWeight(E e,
double weight)
Deprecated. |
void |
setUseAuthorityForRanking(boolean useAuthorityForRanking)
Deprecated. If evaluate() has not already been called, the user can override the type of importance. |
void |
step()
Deprecated. Evaluate the result of the current iteration. |
protected void |
updateAuthorityRankings()
Deprecated. |
protected void |
updateHubRankings()
Deprecated. |
protected void |
updatePreviousScores()
Deprecated. |
Methods inherited from class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker |
---|
getPriorRankScore, getPriors, setPriorRankScore, setPriors |
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 |
Field Detail |
---|
protected static final String AUTHORITY_KEY
protected static final String HUB_KEY
Constructor Detail |
---|
public HITSWithPriors(Graph<V,E> graph, double bias, Set<V> priors)
graph
- the graph whose nodes are to be rankedbias
- the weight that should be placed on the root nodes (between 0 and 1)priors
- the set of root nodespublic HITSWithPriors(Graph<V,E> graph, boolean useAuthorityForRanking, double bias, Set<V> priors, String edgeWeightKey)
graph
- the graph whose nodes are to be rankeduseAuthorityForRanking
- bias
- the weight that should be placed on the root nodes (between 0 and 1)priors
- the set of root nodesMethod Detail |
---|
protected void initialize(Graph<V,E> g, String edgeWeightKeyName)
protected void finalizeIterations()
RelativeAuthorityRanker
finalizeIterations
in class RelativeAuthorityRanker<V,E>
protected double getInEdgeWeight(E e)
protected void setInEdgeWeight(E e, double weight)
public String getRankScoreKey()
getRankScoreKey
in class AbstractRanker<V,E>
protected double getPreviousAuthorityScore(V v)
protected double getPreviousHubScore(V v)
public void step()
IterativeProcess
step
in interface IterativeContext
step
in class IterativeProcess
public void setUseAuthorityForRanking(boolean useAuthorityForRanking)
evaluate()
has not already been called, the user can override the type of importance.
(hub or authority) that should be associated with the rank score.
useAuthorityForRanking
- if true
, authority is used; if false
, hub is usedprotected void updateAuthorityRankings()
protected void updateHubRankings()
protected void updatePreviousScores()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |