TY - GEN
T1 - Concept-aware ranking
T2 - Teaching an old graph new moves
AU - DeLong, Colin
AU - Mane, Sandeep
AU - Srivastava, Jaideep
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - Concept-aware ranking
KW - Concept-page graph
KW - Concepts
KW - Implicit links
KW - Topic drift
UR - http://www.scopus.com/inward/record.url?scp=67650547175&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67650547175&partnerID=8YFLogxK
U2 - 10.1109/icdmw.2006.49
DO - 10.1109/icdmw.2006.49
M3 - Conference contribution
AN - SCOPUS:67650547175
SN - 0769527027
SN - 9780769527024
T3 - Proceedings - IEEE International Conference on Data Mining, ICDM
SP - 80
EP - 85
BT - Proceedings - ICDM Workshops 2006 - 6th IEEE International Conference on Data Mining - Workshops
PB - Institute of Electrical and Electronics Engineers Inc.
ER -