ACM Home Page
Please provide us with feedback. Feedback
Anchor-based proximity measures
Full text PdfPdf (170 KB)
Source
International World Wide Web Conference archive
Proceedings of the 16th international conference on World Wide Web table of contents
Banff, Alberta, Canada
POSTER SESSION: Search table of contents
Pages: 1131 - 1132  
Year of Publication: 2007
ISBN:978-1-59593-654-7
Authors
Amruta Joshi  Yahoo! Research
Ravi Kumar  Yahoo! Research
Benjamin Reed  Yahoo! Research
Andrew Tomkins  Yahoo! Research
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 30,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1242572.1242730
What is a DOI?

ABSTRACT

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 schemesand 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
T.H. Haveliwala. Topic-sensitive PageRank: A context-sensitive ranking algorithm for web search. IEEE Transactions on Knowledge and Data Engineering, 15(4):784--796, 2003.


Collaborative Colleagues:
Amruta Joshi: colleagues
Ravi Kumar: colleagues
Benjamin Reed: colleagues
Andrew Tomkins: colleagues