Interface PageRank

public interface PageRank

PageRank is a link analysis algorithm, and it assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of "measuring" its relative importance within the set. The algorithm may be applied to any collection of entities with reciprocal quotations and references.

PageRank can be computed either iteratively or algebraically. The iterative method can be viewed as the power iteration method.

Field Summary

Fields

Modifier and Type	Field	Description
static final org.slf4j.Logger	logger

Method Summary

Static Methods

Modifier and Type	Method	Description
static Vector	of(Matrix A)	Calculates the page rank vector.
static Vector	of(Matrix A, Vector v)	Calculates the page rank vector.
static Vector	of(Matrix A, Vector v, double damping, double tol, int maxIter)	Calculates the page rank vector.

Field Details

logger

static final org.slf4j.Logger logger

Method Details

of

static Vector of(Matrix A)

Calculates the page rank vector.

Parameters:

A - the matrix supporting matrix vector multiplication operation.

Returns:

the page rank vector.

of

static Vector of(Matrix A,
 Vector v)

Calculates the page rank vector.

Parameters:

A - the matrix supporting matrix vector multiplication operation.

v - the teleportation vector.

Returns:

the page rank vector.

of

static Vector of(Matrix A,
 Vector v,
 double damping,
 double tol,
 int maxIter)

Calculates the page rank vector.

Parameters:

A - the matrix supporting matrix vector multiplication operation.

v - the teleportation vector.

damping - the damper factor.

tol - the desired convergence tolerance.

maxIter - the maximum number of iterations in case that the algorithm does not converge.

Returns:

the page rank vector.