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

Sequencing method of node importance in network

A sorting method and important technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as the network that cannot handle multiple groups of suspension chains

Inactive Publication Date: 2011-02-16
吕琳媛 +1
View PDF5 Cites 24 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The purpose of the present invention is to overcome the deficiencies and limitations of the prior art, and propose a sorting method for the importance of nodes in the network to solve the technical problem of being unable to deal with dangling chains and networks containing multiple groups

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
  • Sequencing method of node importance in network
  • Sequencing method of node importance in network
  • Sequencing method of node importance in network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0023] figure 1 It is a flow chart of a specific embodiment of the ranking method of node importance in the network of the present invention.

[0024] In this example, if figure 1 As shown, in the specific implementation process, firstly, the files with links that need to be sorted are converted into a directed network G, where the nodes in the directed network G are files with links that need to be sorted, such as web pages, etc., and the edges is the link relationship between nodes. For example, when webpages are sorted, the webpage is a node of the directed network G, if webpage A links (points to) webpage B, then a directed edge from A to B will be formed between webpages A and B. This method obtains a directed network G that can describe a plurality of files with links that need to be sorted. The network G can contain dangling chains (nodes with no out-degree), and can also be composed of multiple cliques. None of these will affect the use of this algorithm.

[0025]...

example

[0036] In this example, in order to solve a webpage sorting problem: examine six webpages, respectively labeled page1, page2, page3, page4, page5, page6, and their links are as follows:

[0037] page1 links page2 and page5;

[0038] page2 links to page3;

[0039] page3 links page1, page4 and page5;

[0040] page4 links page2 and page6;

[0041] page5 links page2, page4 and page6;

[0042] page6 links to page1.

[0043] Step 1: Construction of directed network G. In this example, the nodes of the network are web pages, and the relationship between web pages is represented by directed edges. In this way, a directed network G containing 6 nodes and 12 directed edges is obtained according to the link relationship of the above web pages. The schematic diagram of the topology structure of the directed network G is as follows: image 3 shown.

[0044]Step 2: Add a background node and establish a bidirectional link between the background node (Ground Node, GN for short) and ea...

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

The invention discloses a sequencing method of node importance in a network, comprising: in a directed network, adding a background node, and building bidirectional link between the background node and each node in the directed network; at initial time, distributing a unit resource for each node; randomly migrating in the directed network containing the background node to distribute resource until stable state; distributing the resource of the background node in the stable state to other nodes; under the stable state, taking the sum of the resource amount of each node and the resource amount obtained from the background node as the node importance fraction; and according to the importance fraction, sequencing the nodes from high to low, wherein the node which ranks in the front is more important or has bigger influence. On the basis of PageRank, the invention introduces the background node in, so that the original sequencing method depending on the parameter is changed into the method which does not depend on parameters. In addition, the method handles the network sequencing problem containing a plurality of independent groups while solving the problem of dangling links in the node sequencing.

Description

technical field [0001] The invention belongs to the technical field of node analysis in the network, and more specifically relates to a method for sorting the importance of nodes in the network, such as webpages. Background technique [0002] The ordering of node importance in the network is a very important issue, for example, the ordering of web pages is the core of search algorithms. [0003] The most famous ranking method of node importance in the prior art is the U.S. Patent No. US 6285999B1 issued by Lawrence Page on September 4, 2001, that is, "method for ranking nodes in a linked database" (METHOD FOR NODE RANKING IN A LINKED DATABASE ), referred to as the PageRank algorithm. It is part of the Google search engine ranking algorithm and is used to identify the level / importance of web pages. The Google search engine adjusts the results through the PageRank algorithm, so that those pages with more "level / importance" can be ranked higher in the search results, thereby ...

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 吕琳媛周涛张翼成
Owner 吕琳媛
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