Method and apparatus for ranking web page search results
First Claim
1. A method for ranking pages, the method comprising:
- building a neighborhood graph of a plurality of pages;
generating an adjacency matrix based on the neighborhood graph;
determining at least one additional matrix to be combined with the adjacency matrix;
forming a linear combination of the adjacency matrix and the additional matrix to produce a resultant matrix;
determining an eigenvector of the resultant matrix; and
ranking the pages using the eigenvector.
13 Assignments
0 Petitions
Accused Products
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.
296 Citations
17 Claims
-
1. A method for ranking pages, the method comprising:
-
building a neighborhood graph of a plurality of pages;
generating an adjacency matrix based on the neighborhood graph;
determining at least one additional matrix to be combined with the adjacency matrix;
forming a linear combination of the adjacency matrix and the additional matrix to produce a resultant matrix;
determining an eigenvector of the resultant matrix; and
ranking the pages using the eigenvector. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 16, 17)
-
-
10. A system for searching a database and producing ranked results, the system comprising:
-
a database;
a server including an index of pages in the database; and
,a user connected to the server, the user and the server forming at least part of a network;
wherein the user sends a query to the server;
the server runs the query against the index to produce search results including a plurality of pages;
the server builds a neighborhood graph of the plurality of pages;
the server generates an adjacency matrix based on the neighborhood graph;
the server determines at least one additional matrix to be combined with the adjacency matrix;
the server forms a linear combination of the adjacency matrix and the additional matrix to product a resultant matrix;
the server determines an eigenvector of the resultant matrix; and
the server ranks the pages using the eigenvector. - View Dependent Claims (11)
-
-
12. A method for ranking pages, the method comprising:
-
determining a neighborhood of a plurality of pages;
determining respective relationship values between every two pages in the neighborhood based on respective links thereby producing determined respective relationship values;
modifying the determined respective relationship values based on additional information regarding respective pages thereby producing modified determined respective relationship values; and
ranking the pages based on the modified determined respective relationship values. - View Dependent Claims (13, 14, 15)
-
Specification