Adaptive computation of ranking

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C715S252000

Reexamination Certificate

active

07028029

ABSTRACT:
A system and method is disclosed in which a ranking function for a set of document rank values is iteratively solved with respect to a set of linked documents until a first stability condition is satisfied. After such condition is satisfied, some of the ranks will have converged. The ranking function is modified to take into account these converged ranks so as to reduce the ranking function's computation cost. The modified ranking function is then solved until a second stability condition is satisfied. After such condition is satisfied more of the ranks will have converged. The ranking function is again modified and process continues until complete.

REFERENCES:
patent: 6112202 (2000-08-01), Kleinberg
patent: 6285999 (2001-09-01), Page
patent: 6560600 (2003-05-01), Broder
patent: 6584468 (2003-06-01), Gabriel et al.
patent: 6799176 (2004-09-01), Page
patent: 6871202 (2005-03-01), Broder
patent: 2003/0204502 (2003-10-01), Tomlin et al.
patent: 2003/0208478 (2003-11-01), Harvey
patent: 2003/0208482 (2003-11-01), Kim et al.
patent: 2004/0024752 (2004-02-01), Manber et al.
patent: 2004/0111412 (2004-06-01), Broder
Arasu, A., et al., “PageRank Computation and the Structure of the Web: Experiments and Algorithms,”Proceedings of the 11th Int'l World Wide Web Conf., Poster Track, 2002.
Bharat, K., et al., “Improved Algorithms for Topic Distillation in a Hyperlinked Environment,”Proceedings of the ACM-SIGIR, 1998.
Haveliwala, T., “Efficient Computation of PageRank,”Stanford University Technical Report, 1999.
Haveliwala, T., “Topic Sensitive PageRank,”Proceedings of the 11th Int'l World Wide Web Conf., 2002.
Haveliwala, T., et al., “The Second Eigenvalue of the Google Matrix,”Stanford University Technical Report, 2003.
Jeh, G., et al., “Scaling Personalized Web Search,”Proceedings of the 12th Int'l World Wide Web Conf., 2003.
Kamvar, S., et al., “Exploiting the Block Structure of the Web for Computing PageRank,”Stanford University Technical Report, 1999.
Kamvar, S., et al., “Extrapolation Methods for Accelerating PageRank Computations,”Proceedings of the 12th Int'l World Wide Web Conf., 2003.
Page, L., et al., “The PageRank Citation Ranking: Bringing Order to the Web,”Stanford Digital Libraries Working Paper, 1998.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Adaptive computation of ranking does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Adaptive computation of ranking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive computation of ranking will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3585510

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.