Network information propagation method based on length constraint and no repetition path

A technology of network information and length constraints, applied in data exchange networks, transmission systems, digital transmission systems, etc., can solve problems such as inability to accurately describe the trust relationship between nodes, increase the uncertainty of the relationship between nodes, and destroy the network topology. Achieve the effect of increasing uncertainty, improving usability, and ensuring structural properties

Active Publication Date: 2019-07-09
XIDIAN UNIV
View PDF9 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The disadvantage of this method is that because this method introduces additional impact factors, which increases the uncertainty of the relationship between nodes, it cannot accurately describe the trust relationship between nodes.
The disadvantage of this method is that because this method randomly deletes local network edges in the social network platform, it destroys the topology of the network to a large extent, resulting in the problem of low usability of the deleted network.

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
  • Network information propagation method based on length constraint and no repetition path
  • Network information propagation method based on length constraint and no repetition path
  • Network information propagation method based on length constraint and no repetition path

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0053] The present invention will be further described below in conjunction with the accompanying drawings.

[0054] refer to figure 1 , to further describe in detail the specific steps for realizing the present invention.

[0055] Step 1, establish a trust network graph model.

[0056] Read in a dataset with at least 300 network nodes.

[0057] Abstract the data read into the dataset into a directed graph.

[0058] The directed graph is G 1 =(V,E), where V represents the directed graph G 1 A collection of all network nodes in , each network node represents a user in the network, E represents a directed graph G 1 The set of edges of the network nodes in the network, each edge represents the connection relationship between any two network nodes in the network.

[0059] The network adjacency matrix generation method is adopted to generate the adjacency matrix corresponding to the directed graph.

[0060] The steps of the method for generating the network adjacency matrix ...

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 network information propagation method based on length constraint and no repetition path, and mainly solves the trust propagation problem of users in a social network. The method comprises the following steps: 1, establishing a trust network diagram model; 2, determining intermediate network nodes; 3, selecting an optimal path; 4, calculating a network node information value; 5, propagating network messages; and 6, discarding the untrusted network information. By establishing the trust network graph model and selecting the optimal path, the structure attribute of thetrust network is effectively maintained, and the availability of the trust network is improved. According to the method, the network information acceptance degree from the starting node to the terminal node is calculated by using the total number of the non-repetitive paths with the length from the optimal path starting node to the terminal node, and the accuracy of the network information betweenthe nodes is effectively improved while the integrity of a trusted network is ensured.

Description

technical field [0001] The invention belongs to the technical field of computers, and further relates to a network information dissemination method based on length constraints and non-repetitive paths in the technical field of data mining. The invention can be used in complex networks such as microblog, social networking and e-commerce to disseminate trust information such as text and evaluation among different nodes. Background technique [0002] Networks such as social networking and e-commerce are typical complex networks. In this complex network, each person or individual is abstracted as a network node, and the relationship between people is abstracted as the connection between corresponding nodes in the network. The degree of association between nodes can be abstracted as the weight of corresponding edges in the network, thus forming a complex network model, and the trust information of adjacent nodes in the network can be expressed by the weights between nodes. The i...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/751H04L12/721H04L12/24H04L45/02
CPCH04L45/12H04L45/02H04L41/145
Inventor 吴建设周超杰丁振林丁琪琪管铭孙文静
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap