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

Node matching model based on adjacent matrix and evolutionary solving method

An adjacency matrix and matching model technology, applied in the field of complex networks, can solve problems such as loss of validity and unavailability

Inactive Publication Date: 2014-08-20
CHINA UNIV OF MINING & TECH
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Even, in some cases, it is not possible to get the "matched node pair"
In this case, existing methods will lose their effectiveness

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
  • Node matching model based on adjacent matrix and evolutionary solving method
  • Node matching model based on adjacent matrix and evolutionary solving method
  • Node matching model based on adjacent matrix and evolutionary solving method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] The implementation of the present invention will be described in detail below in conjunction with specific examples.

[0030] Step 1. Node matching model based on adjacency matrix

[0031] 1.1 Basic concepts and principles

[0032] Call the ordered three-dimensional array N=(V(N),E(N),ψ N ) is a network, where the non-empty set V(N) is a node set, and its elements are nodes; the set E(N) is an edge set, and its elements are edges; the function ψ N Make each edge of N correspond to a node pair. Sometimes, we also remember the network N=(V,E). If e is an edge, u and v are two nodes, and satisfy ψ N (e)=(u, v), then, e is said to connect u and v, and u and v are the endpoints of e.

[0033] A network H is said to be a subnetwork of N if and

[0034] ψ H (e)=ψ N (e), e∈E(H)

[0035] Networks can be represented graphically or in matrix form. Representing the network with a matrix is ​​convenient for studying the properties of the network with algebraic methods, a...

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 node matching model based on an adjacent matrix and an evolutionary solving method. The model and the method aim to find node corresponding relations of an individual with multiple identities in different networks when associated networks are comprehensively analyzed, and therefore network data are mined. Firstly, the node matching model based on the adjacent matrix is established, evaluation functions for machining advantages and matching disadvantages of two networks are created, the network node matching problem is converted into a function optimization problem, and therefore the problem is simplified; secondly, the evolutionary solving method for the node matching problem is given; at last, three types of common complex networks are utilized to carry out matching experiments. Thus, effectiveness of the provided methods is revealed and detected.

Description

technical field [0001] The invention relates to the complex network field, designs a graph-based adjacency matrix node matching model, and provides its evolutionary solution method. The difference between this method and the existing methods is that it finds the corresponding relationship between nodes (identities) between the networks without any matching information. First, based on the adjacency matrix of the graph, an evaluation function for the matching of the two networks is given. , so that the network node matching problem is transformed into a function optimization problem; secondly, an evolutionary optimization method for solving this problem is proposed. This method enables satisfactory matching accuracy to be obtained without any node matching information, and is of great significance for improving the effectiveness and feasibility of node (identity) correspondence between networks. Background technique [0002] The purpose of matching nodes between networks is ...

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): G06F19/00G06N3/12
Inventor 姚香娟巩敦卫顾雅莉胡雷陈永伟吴川
Owner CHINA UNIV OF MINING & TECH
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