Dynamically ranking nodes and labels in a hyperlinked database

Details Dynamically ranking nodes and labels in a hyperlinked database Dynamically ranking nodes and labels in a hyperlinked database

2011-08-02

2011-08-02

Rones, Charles (Department: 2164)

Data processing: database and file management or data structures

Database and file access

Search engines

C707S711000, C707S790000, C707S798000

Reexamination Certificate

active

07991755

ABSTRACT:
The World Wide Web (WWW) can be modelled as a labelled directed graph G(V,E,L), in which V is the set of nodes, E is the set of edges, and L is a label function that maps edges to labels. This model, when applied to the WWW, indicates that V is a set of hypertext documents or objects, E is a set of hyperlinks connecting the documents in V, and the edge-label function represents the anchor-text corresponding to the hyperlinks. One can find a probabilistic ranking of the nodes for any given label, a ranking of the labels for any given node, and rankings of labels and pages using flow based models. Further, the flows can be computing using sparse matrix operations.

REFERENCES:
patent: 6112202 (2000-08-01), Kleinberg
patent: 6233571 (2001-05-01), Egger et al.
patent: 6285999 (2001-09-01), Page
patent: 6549896 (2003-04-01), Candan et al.
patent: 7076483 (2006-07-01), Preda et al.
patent: 2002/0129014 (2002-09-01), Kim et al.
patent: 2002/0130907 (2002-09-01), Chi et al.
patent: 2003/0018636 (2003-01-01), Chi et al.
patent: 2003/0204502 (2003-10-01), Tomlin et al.
patent: 2005/0086260 (2005-04-01), Canright et al.
patent: 2006/0074903 (2006-04-01), Meyerzon et al.
patent: 2007/0067317 (2007-03-01), Stevenson
Haveliwala, Taher H., “Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search”,Proceedings of the Eleventh International World Wide Web Conference, Honolulu, Hawaii, May 2002.

Affiliated with

Also associated with

Rating

Dynamically ranking nodes and labels in a hyperlinked database does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamically ranking nodes and labels in a hyperlinked database, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamically ranking nodes and labels in a hyperlinked database will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2794168