9 search results - page 1 / 2 » Approximating Aggregate Queries about Web Pages via Random W... |
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
WWW
2004
ACM
14 years 6 months ago
2004
ACM
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
SIGIR
2006
ACM
13 years 11 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
SIGIR
2002
ACM
13 years 4 months ago
2002
ACM
Two popular webpage ranking algorithms are HITS and PageRank. HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight n...
SIGIR
2005
ACM
13 years 10 months ago
2005
ACM
We formulate and study search algorithms that consider a user’s prior interactions with a wide variety of content to personalize that user’s current Web search. Rather than re...