The Community for Technology Leaders
2013 IEEE 13th International Conference on Data Mining Workshops (2006)
Hong Kong, China
Dec. 18, 2006 to Dec. 22, 2006
ISBN: 0-7695-2702-7
pp: 80-88
Jaideep Srivastava , University of Minnesota
Colin DeLong , University of Minnesota
Sandeep Mane , University of Minnesota
In ranking algorithms for web graphs, such as PageRank and HITS, the lack of attention to concepts/topics representing web page content causes problems such as topic drift and mutually reinforcing relationships between hosts. This paper proposes a novel approach to expand the Web graph to incorporate conceptual information encoded by links (anchor text) between web pages. Using web graph link structure and conceptual information associated with each web page (automatically extracted from anchor text of inlinks), a new graph is defined where each node represents a unique pair of a web page and concept associated with that web page, and an edge represents an explicit or implicit link between two such nodes. This graph captures inter-concept relationships, which is then utilized by ranking algorithms. Our experimental results show that such an approach improves accuracy (e.g., first X precision) by retrieving links which are more authoritative given a user?s context.
Jaideep Srivastava, Colin DeLong, Sandeep Mane, "Concept-Aware Ranking: Teaching an Old Graph New Moves", 2013 IEEE 13th International Conference on Data Mining Workshops, vol. 00, no. , pp. 80-88, 2006, doi:10.1109/ICDMW.2006.49
82 ms
(Ver 3.3 (11022016))