Method for identifying related pages in a hyperlinked database
A method is described for identifying related pages among a plurality of pages in a linked database such as the World Wide Web. An initial page is selected from the plurality of pages. Pages linked to the initial page are represented as a graph in a memory. The pages represented in the graph are sco...
Saved in:
Main Authors | , , |
---|---|
Format | Patent |
Language | English |
Published |
08.12.2009
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A method is described for identifying related pages among a plurality of pages in a linked database such as the World Wide Web. An initial page is selected from the plurality of pages. Pages linked to the initial page are represented as a graph in a memory. The pages represented in the graph are scored on content, and a set of pages is selected, the selected set of pages having scores greater than a first predetermined threshold. The selected set of pages is scored on connectivity, and a subset of the set of pages that have scores greater than a second predetermined threshold are selected as related pages. |
---|---|
Bibliography: | Application Number: US20030702116 |