Methods for ranking nodes in large directed graphs

Details Methods for ranking nodes in large directed graphs Methods for ranking nodes in large directed graphs

2007-05-08

2007-05-08

Corrielus, Jean M. (Department: 2162)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C715S252000, C715S252000

Reexamination Certificate

active

10646331

ABSTRACT:
Techniques for assigning ranks to nodes in a large linked database, such as world wide web or any other hypermedia database, partition the nodes so that the link matrix has a predominantly block-diagonal form. Within each block, a local rank is computed for nodes in the block, possibly by different computer in a distributed computing environment. A block rank is then estimated for each block as a whole, and may optionally include block-level weights to implement customized ranking. The local ranks and block ranks are then combined to form a global rank, which may be used to rank the nodes. Alternatively, a global rank vector for the database may be used as an initial vector in an iterative link-based ranking scheme to obtain more accurate global ranks for the nodes. The global rank vector may be divided to provide local rank vectors for use in subsequent applications of the method.

REFERENCES:
patent: 6112202 (2000-08-01), Kleinberg
patent: 6138113 (2000-10-01), Dean et al.
patent: 6285999 (2001-09-01), Page
patent: 6560600 (2003-05-01), Broder
patent: 6584468 (2003-06-01), Gabriel et al.
patent: 6665837 (2003-12-01), Dean et al.
patent: 6799176 (2004-09-01), Page
patent: 6871202 (2005-03-01), Broder
patent: 6922685 (2005-07-01), Greene et al.
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

Affiliated with

Also associated with

Rating

Methods for ranking nodes in large directed graphs does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Methods for ranking nodes in large directed graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods for ranking nodes in large directed graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3764957