Anchor-based proximity measures

We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, 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. Categories and Subject Descriptors: H.3.m [Information Search and Retrieval]: Miscellaneous General Terms: Algorithms, Experimentation.

• Type: Conference
• Year: 2007
• Where: WWW
• Authors: Amruta Joshi, Ravi Kumar, Benjamin Reed, Andrew Tomkins
• Keywords: Directed Graph, Disjoint Anchors, Internet Technology, Miscellaneous General Terms, WWW 2007