Anchor-based proximity measures
- Amruta Joshi (Yahoo! Research)
- Ravi Kumar (Yahoo! Research)
- Benjamin Reed (Yahoo! Research)
- Andrew Tomkins (Yahoo! Research)
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 anchor. Our measures are based on three different propagation schemes 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 --- good and bad web pages --- and study the accuracy of these measures in this context.