Package edu.uci.ics.jung.algorithms.scoring
package edu.uci.ics.jung.algorithms.scoring
Mechanisms for assigning values (denoting significance, influence, centrality, etc.)
to graph elements based on topological properties. These include:
BarycenterScorer
: assigns a score to each vertex according to the sum of the distances to all other verticesClosenessCentrality
: assigns a score to each vertex based on the mean distance to each other vertexDegreeScorer
: assigns a score to each vertex based on its degreeEigenvectorCentrality
: assigns vertex scores based on long-term probabilities of random walks passing through the vertex at time tPageRank
: likeEigenvectorCentrality
, but with a constant probability of the random walk restarting at a uniform-randomly chosen vertexPageRankWithPriors
: likePageRank
, but with a constant probability of the random walk restarting at a vertex drawn from an arbitrary distributionHITS
: assigns hubs-and-authorities scores to vertices based on complementary random walk processesHITSWithPriors
: analogous toHITS
(seePageRankWithPriors
)VoltageScorer
: assigns scores to vertices based on simulated current flow along edges
-
ClassDescriptionAbstractIterativeScorer<V,
E, T> An abstract class for algorithms that assign scores to vertices based on iterative methods.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).BarycenterScorer<V,E> Assigns scores to each vertex according to the sum of its distances to all other vertices.Computes betweenness centrality for each vertex and edge in the graph.ClosenessCentrality<V,E> Assigns scores to each vertex based on the mean distance to each other vertex.DegreeScorer<V>Assigns a score to each vertex equal to its degree.Assigns scores to vertices based on their distances to each other vertex in the graph.EdgeScorer<E,S> An interface for algorithms that assign scores to edges.Calculates eigenvector centrality for each vertex in the graph.HITS<V,E> Assigns hub and authority scores to each vertex depending on the topology of the network.Maintains hub and authority score information for a vertex.HITSWithPriors<V,E> A generalization of HITS that permits non-uniformly-distributed random jumps.KStepMarkov<V,E> A special case ofPageRankWithPriors
in which the final scores represent a probability distribution over position assuming a random (Markovian) walk of exactly k steps, based on the initial distribution specified by the priors.PageRank<V,E> Assigns scores to each vertex according to the PageRank algorithm.PageRankWithPriors<V,E> A generalization of PageRank that permits non-uniformly-distributed random jumps.VertexScorer<V,S> An interface for algorithms that assign scores to vertices.VoltageScorer<V,E> Assigns scores to vertices according to their 'voltage' in an approximate solution to the Kirchoff equations.