Graph Node Ranking Algorithm
(Redirected from graph node ranking)
Jump to navigation
Jump to search
A Graph Node Ranking Algorithm is an graph-based object ranking algorithm that can solve a Graph Node Ranking Task.
- AKA: Link-based Object Ranking Algorithm.
- Context:
- It can range from being a Directed Graph Node Ranking Algorithm to being an Undirected Graph Node Ranking Algorithm.
- …
- Example(s):
- a Random Arrival Likelihood Scoring Algorithm, such as a PageRank Algorithm.
- HITS Algorithm.
- …
- Counter-Example(s):
- See: Link-based Object Ranking System.
References
2005
- (Getoor & Diehl, 2005) ⇒ Lise Getoor, and Christopher P. Diehl. (2005). “Link Mining: A survey.” In: SIGKDD Explorations, 7(2). doi:10.1145/1117454.1117456
- QUOTE: Perhaps the most well known link mining task is that of link-based object ranking (LBR), which is a primary focus of the link analysis community. The objective of LBR is to exploit the link structure of a graph to order or prioritize the set of objects within the graph. Much of this research focuses on graphs with a single object type and a single link type. In the context of web information retrieval, the PageRank [91] and HITS [64] algorithms are the most notable approaches to LBR.