hits: Hyperlink-induced topic search

In ekstroem/networkR: Network Analysis and Visualization

Description

Hyperlink-induced topic search (HITS) is a link analysis algorithm that is also known as hubs and authorities. It rates nodes by comparing arrows pointing in and out of nodes in an asymmetrical graph.

Usage

hits(adjmatrix, maxiter = 100L, tol = 1e-05)

Arguments

adjmatrix	an adjacency matrix
maxiter	non-negative integer
tol	positive numeric value to be used as tolerance threshold for convergence

Details

Hubs are nodes with a lot of arrows pointing out while authorities are node with a lot of arrows pointing in.

Value

Returns a list with three elements: authorities (a vector) of and hubs (a vector), and number of iterations used.

Author(s)

Claus Ekstrom [e-mail]

References

Kleinberg, Jon (1999). "Authoritative sources in a hyperlinked environment" (PDF). Journal of the ACM. 46 (5): 604–632. doi:10.1145/324133.324140

Examples

from <- c("A", "A", "A", "B", "C")
to <- c("B", "C", "D", "D", "E")
hits(adjacency(from, to))

ekstroem/networkR documentation built on July 25, 2020, 8:30 a.m.