Poster Title:

Anchor-based Proximity Measures

Authors:

• Amruta Joshi (Yahoo! Research)
• Ravi Kumar (Yahoo! Research)
• Benjamin Reed (Yahoo! Research)
• Andrew Tomkins (Yahoo! Research)

Abstract:

We present a family of measures of proximity of an arbitrary vertex in a directed graph to a pre-specified subset of vertices, called the and two different uses of the connectivity structure of the graph. We consider a web-specific application of the above measures with two disjoint anchors --- \emph{good} and \emph{bad} web pages --- and study the accuracy of these measures in this context.