Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Improved methods for ranking nodes in large directed graphs

A node and rank technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problem that it takes a lot of time to calculate rank

Inactive Publication Date: 2008-05-07
THE BOARD OF TRUSTEES OF THE LELAND STANFORD JUNIOR UNIV
View PDF2 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] While these link-based ranking techniques are an improvement over existing techniques, in the case of very large databases, such as the World Wide Web containing billions of pages, computing the ranking for all pages can take considerable time

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Improved methods for ranking nodes in large directed graphs
  • Improved methods for ranking nodes in large directed graphs
  • Improved methods for ranking nodes in large directed graphs

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0014] Specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings. Although these detailed descriptions contain many details for purposes of illustration, those skilled in the art will understand that many modifications and substitutions may be made to those details within the scope of the invention. Accordingly, these embodiments of the invention are set forth without any loss of generality of the invention and without imposing limitations on the invention.

[0015] According to an embodiment of the present invention, a method for efficiently ranking nodes in a link database is provided. Typically, a link database has the structure of a directed graph of N link nodes, where the nodes represent documents, records, or other data units, and the links between the nodes represent references, references, or other links between the nodes. Examples of link databases include linked electronic hypertext documents, journa...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

Techniques for assigning ranks to nodes in a large linked database, such as world wide web or any other hypermedia database, partition the nodes so that the link matrix has a predominantly block-diagonal form. Within each block, a local rank is computed for nodes in the block, possibly by different computer in a distributed computing environment. A block rank is then estimated for each block as a whole, and may optionally include blocklevel weights to implement customized ranking. The local ranks and block ranks are then combined to form a global rank, which may be used to rank the nodes. Alternatively, a global rank vector for the database may be used as an initial vector in an iterative link-based ranking scheme to obtain more accurate global ranks for the nodes. The global rank vector may be divided to provide local rank vectors for use in subsequent applications of the method.

Description

technical field [0001] The present invention generally relates to improved techniques for analyzing large directed graphs. More specifically, the present invention relates to a method for reducing the computational complexity of assigning ranks to nodes in a large linked database such as the World Wide Web or any other hypermedia database. Background technique [0002] A linked database (i.e., any database containing documents that reference each other, such as the World Wide Web or other hypermedia archives) can be represented as a directed graph of N nodes, where each node corresponds to a document, and where there are A directional link corresponds to a directional link from one document to another. A given node has a set of forward links connecting it to child nodes, and a set of backward links connecting it to the parent node. [0003] It is often useful to rank or assign significant values ​​to nodes. For example, the relevance of database search results can be impr...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F17/30
Inventor 塞潘达·D·坎瓦尔泰尔·H·哈夫利瓦拉格伦·杰吉恩·戈拉布
Owner THE BOARD OF TRUSTEES OF THE LELAND STANFORD JUNIOR UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com