A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Concept-Aware Ranking: Teaching an Old Graph New Moves
2006
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)
Ranking algorithms for web graphs, such as PageRank and HITS, are typically utilized for graphs where a node represents a unique URL (Webpage) and an edge is an explicitly-defined link between two such nodes. In addition to the link structure itself, additional information about the relationship between nodes may be available. For example, anchor text in a Web graph is likely to provide information about the underlying concepts connecting URLs. In this paper, we propose an extension to the Web
doi:10.1109/icdmw.2006.49
dblp:conf/icdm/DeLongMS06
fatcat:g2gtwf6frbh2bl5q2ktbnxyite