Graph Node Ranking Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
 
No edit summary
Line 1: Line 1:
#REDIRECT [[Link-based Object Ranking Algorithm]]
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> [[Link-based Object Ranking Algorithm]].
* <B>Example(s):</B>
** [[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]]) &rArr; [[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]
** <U>QUOTE</U>: 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 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|algorithms]] are the most notable approaches to [[LBR Task|LBR]].
 
----

Revision as of 17:04, 18 June 2013

A Graph Node Ranking Algorithm is an graph-based object ranking algorithm that can solve a Graph Node Ranking Task.



References

2005