Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2003-11-03
2009-12-08
Jalil, Neveen Abel (Department: 2165)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
07630973
ABSTRACT:
A method is described for identifying related pages among a plurality of pages in a linked database such as the World Wide Web. An initial page is selected from the plurality of pages. Pages linked to the initial page are represented as a graph in a memory. The pages represented in the graph are scored on content, and a set of pages is selected, the selected set of pages having scores greater than a first predetermined threshold. The selected set of pages is scored on connectivity, and a subset of the set of pages that have scores greater than a second predetermined threshold are selected as related pages.
REFERENCES:
patent: 3996569 (1976-12-01), Saunders
patent: 4803643 (1989-02-01), Hickey
patent: 5103079 (1992-04-01), Barakai et al.
patent: 5241671 (1993-08-01), Reed et al.
patent: 5278980 (1994-01-01), Pedersen et al.
patent: 5287278 (1994-02-01), Rau
patent: 5418948 (1995-05-01), Turtle
patent: 5706507 (1998-01-01), Schloss
patent: 5754938 (1998-05-01), Herz et al.
patent: 5855015 (1998-12-01), Shoham
patent: 5875446 (1999-02-01), Brown et al.
patent: 5878233 (1999-03-01), Schloss
patent: 5991713 (1999-11-01), Unger et al.
patent: 6029195 (2000-02-01), Herz
patent: 6073135 (2000-06-01), Broder et al.
patent: 6112202 (2000-08-01), Kleinberg
patent: 6138113 (2000-10-01), Dean et al.
patent: 6167398 (2000-12-01), Wyard et al.
patent: 6233575 (2001-05-01), Agrawal et al.
patent: 6256648 (2001-07-01), Hill et al.
patent: 6285999 (2001-09-01), Page
patent: 6334132 (2001-12-01), Weeks
patent: 6334145 (2001-12-01), Adams et al.
patent: 6389436 (2002-05-01), Chakrabarti et al.
patent: 6411952 (2002-06-01), Bharat et al.
patent: 6647381 (2003-11-01), Li et al.
patent: 6665837 (2003-12-01), Dean et al.
patent: 6711568 (2004-03-01), Bharat et al.
patent: 2002/0129014 (2002-09-01), Kim et al.
Marchiori, M. 1997. The quest for correct information on the Web: hyper search engines. Comput. Netw. ISDN Syst. 29, 8-13 (Sep. 1997), 1225-1235. DOI= http://dx.doi.org/10.1016/S0169-7552(97)00036-6.
E. W. Dijkstra, “A note on two problems in connexion with graphs”. In Numerische Mathematik, 1 (1959), S. 269-271.
Brin, S. and Page, L. 1998. The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. ISDN Syst. 30, 1-7 (Apr. 1998), 107-117. DOI= http://dx.doi.org/10.1016/S0169-7552(98)00110-X.
Black Jeffrey Dean
Broder Andrei Z.
Henzinger Monika R.
Abel Jalil Neveen
Ostrow Seth H.
Ostrow Kaufman & Frankl LLP
Radtke Mark Andrew X
Yahoo ! Inc.
LandOfFree
Method for identifying related pages 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 Method for identifying related pages in a hyperlinked database, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for identifying related pages in a hyperlinked database will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4067576