Method for ranking hyperlinked pages using content and connectivity analysis
First Claim
1. A computerized method for ranking documents including information content, comprising:
- representing an input set of documents as a graph of nodes and directed edges in a memory, each node to represent one document, and each directed edge connecting a pair of nodes to represent a linkage between the pair of documents;
ranking the input set of documents represented in the graph according to their contents;
selecting a subset of documents from the input set of documents having a content ranking greater than a first predetermined threshold and deleting nodes in the graph representing all other documents wherein the first predetermined threshold is a median content ranking of the input set of documents;
ranking the selected subset of documents according to their linkage; and
selecting an output set of documents from the subset of documents having a linkage ranking greater than a second predetermined threshold.
9 Assignments
0 Petitions
Accused Products
Abstract
A computerized method determines the ranking of documents including information content. The present method uses both content and connectivity analysis. An input set of documents is represented as a neighborhood graph in a memory. In the graph, each node represents one document, and each directed edge connecting a pair of nodes represents a linkage between the pair of documents. The input set of documents represented in the graph is ranked according to the contents of the documents. A subset of documents is selected from the input set of documents if the content ranking of the selected documents is greater than a first predetermined threshold. Nodes representing any documents, other than the selected documents, are deleted from the graph. The selected subset of documents is ranked according the linkage of the documents, and an output set of documents exceeding a second predetermined threshold is selected for presentation to users.
150 Citations
48 Claims
-
1. A computerized method for ranking documents including information content, comprising:
-
representing an input set of documents as a graph of nodes and directed edges in a memory, each node to represent one document, and each directed edge connecting a pair of nodes to represent a linkage between the pair of documents;
ranking the input set of documents represented in the graph according to their contents;
selecting a subset of documents from the input set of documents having a content ranking greater than a first predetermined threshold and deleting nodes in the graph representing all other documents wherein the first predetermined threshold is a median content ranking of the input set of documents;
ranking the selected subset of documents according to their linkage; and
selecting an output set of documents from the subset of documents having a linkage ranking greater than a second predetermined threshold. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A method for providing an output set of ranked documents, comprising:
-
representing an input set of documents as a graph of nodes and directed edges in a memory, each node to represent one document, and each directed edge connecting a pair of nodes to represent a linkage between the pair of documents;
ranking the input set of documents represented in the graph according to their contents;
selecting a subset of documents from the input set of documents having a content ranking greater than a first predetermined threshold and deleting nodes in the graph representing all other documents wherein the first predetermined threshold is the median content ranking of the input set of documents;
ranking the selected subset of documents according to their linkage; and
selecting an output set of documents from the subset of documents having a linkage ranking greater than a second predetermined threshold. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32)
-
-
33. A Web search engine that provides an output set of ranked documents, comprising:
-
a graphing module that represents an input set of documents as a graph of nodes and directed edges in a memory, each node to represent one document, and each directed edge connecting a pair of nodes to represent a linkage between the pair of documents;
a content ranking module that ranks the input set of documents represented in the graph according to their contents;
a content selection module that selects a subset of documents from the input set of documents having a content ranking greater than a first predetermined threshold and deleting nodes in the graph representing all other documents wherein the first predetermined threshold is the median content ranking of the input set of documents;
a linkage ranking module that ranks the selected subset of documents according to their linkage; and
a linkage selection module that selects an output set of documents from the subset of documents having a linkage ranking greater than a second predetermined threshold. - View Dependent Claims (34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48)
-
Specification