Graph Node Ranking Algorithm: Difference between revisions
Jump to navigation
Jump to search
(Redirected page to Link-based Object Ranking Algorithm) |
m (Text replacement - ". ----" to ". ----") |
||
| (20 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
A [[Graph Node Ranking Algorithm]] is an [[graph algorithm|graph-based]] [[object ranking algorithm]] that can solve a [[Graph Node Ranking Task]]. | |||
* <B>AKA:</B> [[Graph Node Ranking Algorithm|Link-based Object Ranking Algorithm]]. | |||
* <B>Context:</B> | |||
** It can range from being a [[Directed Graph Node Ranking Algorithm]] to being an [[Undirected Graph Node Ranking Algorithm]]. | |||
** … | |||
* <B>Example(s):</B> | |||
** a [[Random Arrival Likelihood Scoring Algorithm]], such as a [[PageRank Algorithm]]. | |||
** [[HITS Algorithm]]. | |||
** … | |||
* <B>Counter-Example(s):</B> | |||
** a [[Connected Components Algorithm]]. | |||
** a [[Shortest Path Algorithm]]. | |||
* <B>See:</B> [[Link-based Object Ranking System]]. | |||
---- | |||
---- | |||
== References == | |||
=== 2005 === | |||
* ([[2005_LinkMiningASurvey|Getoor & Diehl, 2005]]) ⇒ [[Lise Getoor]], and [[Christopher P. Diehl]]. ([[2005]]). “[http://www.kdd.org/explorations/issues/7-2-2005-12/1-Getoor.pdf Link Mining: A survey].” In: [[SIGKDD Explorations]], 7(2). [http://dx.doi.org/10.1145/1117454.1117456 doi:10.1145/1117454.1117456] | |||
** QUOTE: Perhaps the most well known [[Link Mining Task|link mining task]] is that of [[Link-based Object Ranking Task|link-based object ranking (LBR)]], which is a primary focus of the [[link analysis community]]. The [[task objective|objective]] of [[LBR Task|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 [[Unlabeled Graph|graphs with a single object type and a single link type]]. In the context of [[Web Information Retrieval Task|web information retrieval]], the [[PageRank Algorithm|PageRank]] [91] and [[HITS Algorithm|HITS]] [64] [[Web Information Retrieval Algorithm|algorithm]]s are the most notable approaches to [[LBR Task|LBR]]. | |||
---- | |||
__NOTOC__ | |||
[[Category:Concept]] | |||
Latest revision as of 17:02, 28 June 2021
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.