![Top of Menu](images/menuTop.jpg)
![Home](images/menuHome.jpg)
![CFP](images/menuCfp.jpg)
![Program](images/menuProgramS.jpg)
![Committees](images/menuCommittee.jpg)
![Key Dates](images/menuKeyDates.jpg)
![Location](images/menuLocation.jpg)
![Hotel](images/menuHotel.jpg)
![Registration](images/menuRegistration.jpg)
![Students](images/menuStudents.jpg)
![Sponsors](images/menuSponsors.jpg)
![Media](images/menuMedia.jpg)
![Submission](images/menuSubmission.jpg)
![Tutorials](images/menuTutorial.jpg)
![Workshops](images/menuWorkshops.jpg)
![Travel Info](images/menuTravel.jpg)
![Proceedings](images/menuProceedings.jpg)
Track: Search
Paper Title:
Anchor-based proximity measures
Authors:
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
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.