Method for ranking hyperlinked pages using content and connectivity analysis
First Claim
1. A computer implemented method for ranking linked data objects containing information content, the method comprising the steps of:
- generating an input set of linked data objects based upon a topic, each of the linked data objects having at least one link to another linked data object;
ranking the linked data objects in the input set based at least in part upon their closeness to the topic;
generating a subset of linked data objects from the input set of linked data objects having a closeness ranking greater than a first predetermined threshold;
ranking the linked data objects in the subset based at least in part upon their links; and
generating an output set of linked data objects from the subset of linked data objects having a link ranking greater than a second predetermined threshold.
5 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.
80 Citations
17 Claims
-
1. A computer implemented method for ranking linked data objects containing information content, the method comprising the steps of:
-
generating an input set of linked data objects based upon a topic, each of the linked data objects having at least one link to another linked data object; ranking the linked data objects in the input set based at least in part upon their closeness to the topic; generating a subset of linked data objects from the input set of linked data objects having a closeness ranking greater than a first predetermined threshold; ranking the linked data objects in the subset based at least in part upon their links; and generating an output set of linked data objects from the subset of linked data objects having a link 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)
-
Specification