US6560600B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for ranking Web page search results
Assignee: Starboard Value Intermediate Fund Lp As Collateral Agent
•
Filing: 2000-10-25
•
Granted: 2003-05-06
•
Expires: 2020-10-25
Abstract
Abstract A method and apparatus for ranking a plurality of pages identified during a search of a linked database includes forming a linear combination of two or more matrices, and using the coefficients of the eigenvector of the resulting matrix to rank the quality of the pages. The matrices includes information about the pages and are generally normalized, stochastic matrices. The linear combination can include attractor matrices that indicate desirable or "high quality" sites, and/or non-attractor matrices that indicate sites that are undesirable. Attractor matrices and non-attractor matrices can be used alone or in combination with each other in the linear combination. Additional bias toward high quality sites, or away from undesirable sites, can be further introduced with probability weighting matrices for attractor and non-attractor matrices. Other known matrices, such as a co-citation matrix or a bibliographic coupling matrix, can also be used in the present invention.
Inventors
- 👤 Andrei Z. Broder
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 06:36
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/95; G06F16/953; G06F16/9538; G06F16/951; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99934; Y10S707/99935; Y10S707/99937; Y10S707/99941; Y10S707/99942
Claims Analysis
Total Claims: 42
Claim 1
Independent Claim
60 words
A method of ranking a plurality of pages identified during a search of a linked database, the method comprising: forming a linear combination of two or more matrices, wherein each matrix includes information about at least a portion of the plurality of pages; determining an eigenvector of the linear combination; and ranking the plurality of pages based on the eigenvector.
Claim 2
Independent Claim
60 words
A method of ranking a plurality of pages identified during a search of a linked database, the method comprising: forming a linear combination of two or more matrices, wherein each matrix includes information about at least a portion of the plurality of pages; determining an eigenvector of the linear combination; and ranking the plurality of pages based on the eigenvector.
Claim 3
Dependent Claim
16 words
The method, as set forth in claim 1 , wherein the eigenvector is the principal eigenvector.
Claim 4
Dependent Claim
15 words
The method, as set forth in claim 1 , wherein the matrices are stochastic matrices.
Claim 5
Dependent Claim
20 words
The method, as set forth in claim 1 , wherein at least one of the matrices is an attractor matrix.
Claim 6
Dependent Claim
25 words
The method, as set forth in claim 4 , wherein at least one of the matrices is a probability matrix for weighting the attractor matrix.
Claim 7
Dependent Claim
20 words
The method, as set froth in claim 1 , wherein at least one of the matrices is a non-attractor matrix.
Claim 8
Dependent Claim
25 words
The method, as set froth in claim 6 , wherein at least one of the matrices is a probability matrix for weighting the non-attractor matrix.
Claim 9
Dependent Claim
20 words
The method, as set forth in claim 1 , wherein at least one of the matrices is a co-citation matrix.
Claim 10
Dependent Claim
21 words
The method, as set froth in claim 1 , wherein at least one of the matrices is a bibliographic coupling matrix.
Claim 11
Dependent Claim
41 words
The method, as set froth in claim 1 , wherein ranking the plurality of pages based on the eigenvector comprises: determining ranking categories based on the number of pages to be ranked; and classifying each page in one of the categories.
Claim 12
Dependent Claim
24 words
The method, as set forth in claim 10 , further comprising: allotting a fixed amount of storage for representing the rank of each page.
Claim 13
Dependent Claim
38 words
The method, as set forth in claim 10 , wherein each bit in the fixed amount of storage represents one of the categories and the rank of each page is represented by the bit assigned to the page.
Claim 14
Dependent Claim
31 words
The method, as set forth in claim 1 , further comprising: combining eigenvector coefficients of neighboring pages to generate a hub score for at least one of the plurality of pages.
Claim 15
Dependent Claim
74 words
A computer program product for ranking a plurality of pages identified during a search of a linked database, the product comprising: first program instructions for forming a linear combination of two or more matrices, wherein each matrix includes information about at least a portion of the plurality of pages; second program instructions for determining an eigenvector of the linear combination; and third program instructions for ranking the plurality of pages based on the eigenvector.
Claim 16
Dependent Claim
74 words
A computer program product for ranking a plurality of pages identified during a search of a linked database, the product comprising: first program instructions for forming a linear combination of two or more matrices, wherein each matrix includes information about at least a portion of the plurality of pages; second program instructions for determining an eigenvector of the linear combination; and third program instructions for ranking the plurality of pages based on the eigenvector.
Claim 17
Dependent Claim
16 words
The product, as set froth in claim 14 , wherein the eigenvector is the principal eigenvector.
Claim 18
Dependent Claim
15 words
The product, as set forth in claim 14 , wherein the matrices are stochastic matrices.
Claim 19
Dependent Claim
20 words
The product, as set forth in claim 14 , wherein at least one of the matrices is an attractor matrix.
Claim 20
Dependent Claim
25 words
The product, as set froth in claim 17 , wherein at least one of the matrices is a probability matrix for weighting the attractor matrix.
Claim 21
Dependent Claim
20 words
The product, as set forth in claim 14 , wherein at least one of the matrices is a non-attractor matrix.
Claim 22
Dependent Claim
25 words
The product, as set forth in claim 19 , wherein at least one of the matrices is a probability matrix for weighting the non-attractor matrix.
Claim 23
Dependent Claim
20 words
The product, as set forth in claim 14 , wherein at least one of the matrices is a co-citation matrix.
Claim 24
Dependent Claim
21 words
The product, as set forth in claim 14 , wherein at least one of the matrices is a bibliographic coupling matrix.
Claim 25
Dependent Claim
39 words
The product, as set forth in claim 14 , wherein the third program instructions are further operable to determine ranking categories based on the number of pages to be ranked; and classify each page in one of the categories.
Claim 26
Dependent Claim
31 words
The product, as set forth in claim 23 , wherein the third program instructions are further operable to allot a fixed amount of storage for representing the rank of each page.
Claim 27
Dependent Claim
38 words
The product, as set froth in claim 24 , wherein each bit in the fixed amount of storage represents one of the categories and the rank of each page is represented by the bit assigned to the page.
Claim 28
Dependent Claim
35 words
The product, as set forth in claim 14 , further comprising: fourth program instructions for combining eigenvector coefficients of neighboring pages to generate a hub score for at least one of the plurality of pages.
Claim 29
Independent Claim
66 words
A device for ranking a plurality of pages identified during a search of a linked database, the device comprising: means for forming a linear combination of two or more matrices, wherein each matrix includes information about at least a portion of the plurality of pages; means for determining an eigenvector of the linear combination; and means for ranking the plurality of pages based on the eigenvector.
Claim 30
Independent Claim
66 words
A device for ranking a plurality of pages identified during a search of a linked database, the device comprising: means for forming a linear combination of two or more matrices, wherein each matrix includes information about at least a portion of the plurality of pages; means for determining an eigenvector of the linear combination; and means for ranking the plurality of pages based on the eigenvector.
Claim 31
Dependent Claim
16 words
The device, as set forth in claim 27 , wherein the eigenvector is the principal eigenvector.
Claim 32
Dependent Claim
15 words
The device, as set forth in claim 27 , wherein the matrices are stochastic matrices.
Claim 33
Dependent Claim
20 words
The device, as set forth in claim 27 , wherein at least one of the matrices is an attractor matrix.
Claim 34
Dependent Claim
25 words
The device, as set forth in claim 30 , wherein at least one of the matrices is a probability matrix for weighting the attractor matrix.
Claim 35
Dependent Claim
20 words
The device, as set forth in claim 27 , wherein at least one of the matrices is a non-attractor matrix.
Claim 36
Dependent Claim
25 words
The device, as set forth in claim 32 , wherein at least one of the matrices is a probability matrix for weighting the non-attractor matrix.
Claim 37
Dependent Claim
20 words
The device, as set forth in claim 27 , wherein at least one of the matrices is a co-citation matrix.
Claim 38
Dependent Claim
21 words
The device, as set forth in claim 27 , wherein at least one of the matrices is a bibliographic coupling matrix.
Claim 39
Dependent Claim
48 words
The device, as set forth in claim 27 , wherein the means for ranking the plurality of pages based on the eigenvector comprises: means for determining ranking categories based on the number of pages to be ranked; and means for classifying each page in one of the categories.
Claim 40
Dependent Claim
26 words
The device, as set forth in claim 36 , further comprising; means for allotting a fixed amount of storage for representing the rank of each page.
Claim 41
Dependent Claim
38 words
The device, as set forth in claim 36 , wherein each bit in the fixed amount of storage represents one of the categories and the rank of each page is represented by the bit assigned to the page.
Claim 42
Dependent Claim
33 words
The device, as set forth in claim 27 , further comprising; means for combining eigenvector coefficients of neighboring pages to generate a hub score for at least one of the plurality of pages.
References Cited (Backward Citations)
US6285999B1
Cited
US5895470A
Cited
US6073135A
Cited
US6112203A
Cited
US6138113A
Cited
US6321220B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2006-05-05 | 2006-11-04 | 2007-05-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2010-05-05 | 2010-11-04 | 2011-05-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2014-05-05 | 2014-11-04 | 2015-05-06 | $7700.00 | Window Closed / Lapsed |