Inferring relations between internet objects that are not...

Electrical computers and digital processing systems: multicomput – Remote data accessing – Using interconnected networks

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000

Reexamination Certificate

active

09902421

ABSTRACT:
An inferred relation weighting process for determining the strength of an inferred relation between a first and a second Internet object which are not directly linked includes a first link weighting process for determining the strength of at least a first link between the first non-directly linked Internet object and a common object. A second link weighting process determines the strength of at least a second link between the second non-directly linked Internet object and the common object. An inferred relation weight calculation process calculates the strength of the inferred relation based on the strength of the at least a first link and the at least a second link.

REFERENCES:
patent: 5197005 (1993-03-01), Shwartz et al.
patent: 5694594 (1997-12-01), Chang
patent: 5875446 (1999-02-01), Brown et al.
patent: 5920859 (1999-07-01), Li
patent: 5987446 (1999-11-01), Corey et al.
patent: 5999929 (1999-12-01), Goodman
patent: 6006225 (1999-12-01), Bowman et al.
patent: 6112202 (2000-08-01), Kleinberg
patent: 6138113 (2000-10-01), Dean et al.
patent: 6230153 (2001-05-01), Howard et al.
patent: 6275820 (2001-08-01), Navin-Chandra et al.
patent: 6286006 (2001-09-01), Bharat et al.
patent: 6304864 (2001-10-01), Liddy et al.
patent: 6505191 (2003-01-01), Baclawski
patent: 6523019 (2003-02-01), Borthwick
patent: 6571231 (2003-05-01), Sedlar
patent: 6591261 (2003-07-01), Arthurs
patent: 6636848 (2003-10-01), Aridor et al.
patent: 6647386 (2003-11-01), Hollines et al.
patent: 6751612 (2004-06-01), Schuetze et al.
patent: 6772150 (2004-08-01), Whitman et al.
patent: 6853993 (2005-02-01), Ortega et al.
patent: 2001/0020238 (2001-09-01), Tsuda
patent: 2002/0065836 (2002-05-01), Sasaki
patent: 2003/0074369 (2003-04-01), Schuetze et al.
patent: 2003/0101286 (2003-05-01), Kolluri et al.
patent: 2003/0177114 (2003-09-01), Lin et al.
Search Engine Northern Light(R) Debuts News Ranking . . . , PR Newswire, New York, Oct. 25, 1999.
Two-level document ranking using mutal information in natural lnaguage information retrieval, Hyun-Kyu Kan et al., Science Direct, Jun. 9, 1998.
Associative information access using DualNAVI,, Takano A. et al, Digital Libraries . . . , Nov. 13, 2000.
Erica Chisholm and Tamara G. Kolda,New Term Weighting Formulas for the Vector Space□□Method in Information Retrieval, Mar. 1999.
Nick Craswell, David Hawking, Stephen Robertson, Effective site finding using link anchor information, SIGIR'01, Sep. 9-12, 2001, New Orleans, Louisiana, USA. ACM.
Ralf Steinberger, Bruno Pouliquen, Johan Hagman, Cross-Lingual Document Similarity Calculation Using the Multilingual Thesaurus EUROVOC, Feb. 17-23, 2002. pp. 101-121.
Brin, et al., “The Anatomy of a Large-Scale Hypertextual Web Search Engine,” WWW7/Computer Networks 30 (1-7): 107-117 (1998), http://dbpubs.stanford.edu/pub/1998-8.
Ian Rogers, “The Google Pagerank Algorithm and How It Works,” IPR Computing Ltd., http://www.iprcom.com/papers/pagerank/.
Phil Craven, “Google's PageRank Explained and how to make the most of it,” http://www.webworkshop.net/paperank.html.

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

Inferring relations between internet objects that are not... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Inferring relations between internet objects that are not..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inferring relations between internet objects that are not... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3834049

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