Method for matching weight iteration nodes between weighting networks
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A matching method and iterative node technology, applied in the field of data mining and complex network analysis, can solve problems such as low precision and poor matching effect, and achieve the effect of improving matching accuracy and improving matching effect
Active Publication Date: 2013-07-17
ZHEJIANG UNIV OF TECH
View PDF3 Cites 13 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0005] In order to overcome the shortcomings of poor matching effect and low precision of the existing iterative node matching method, the present
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
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Example Embodiment
[0026] detailed description
[0027] The present invention will be further described below in conjunction with the drawings.
[0028] Reference Figure 1 ~ Figure 6 , A weighted iterative node matching method between weighted networks. It uses the local topology information and link weight information provided by several matched node pairs to calculate the similarity between unmatched node pairs, and considers the positive and negative correlations of the link weights between networks. The impact of similarity. Based on its iterative nature, each time only a pair of unmatched nodes with the greatest similarity is selected as a matched node pair, it will be further regarded as a pair of newly revealed matched node pairs to recalculate the remaining unmatched node pairs The degree of similarity between until some termination conditions are met.
[0029] The steps of the weighted iterative node matching algorithm between weighted networks are as follows:
[0030] Step 1: Selection of ...
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
Login to view more
Abstract
A method for matching weight iteration nodes between weighting networks includes the steps: firstly, selecting matched node pairs; secondly, calculating similarity by respectively connecting two unmatched nodes from different networks with k matched node pairs l=1, 2, ..., recording the weight of a connecting edge between vi1 and vl1 as wl1, recording the weight of a connecting edge between vj2 and vl2 as wl2 and defining the similarity of the nodes between the weighting networks as (4); thirdly, matching the nodes by selecting a pair of unmatched nodes with the highest similarity and belonging to different networks as a current matching node pair in each turn of iteration, considering the pair of unmatched nodes as a newly revealed matched node pair, turning to the second step and recalculating the similarity according to the formula (4); and fourthly, finishing matching until all the nodes in one target network are matched. By the method, matching effect and matching precision are improved.
Description
technical field [0001] The invention relates to data mining and complex network analysis technology, especially a node matching method. Background technique [0002] With the development of computer science, people are more and more accustomed to using networks to describe the world, such as protein networks in organisms (see literature [1] E.Ravasz, A.L.Somera, D.A.Mongru, Z.N.Oltvai, and A.L.Barabási, Hierarchical Organization of Modularity in Metabolic Networks, Science, 297(5586): 1551-1555, 2002. Namely, Lauworth, Sommer, Mongrel, Oltevoy, Barabasi, Hierarchical Modular Organization in Metabolic Networks , "Science", 297(5586):1551-1555, 2002. Literature [2] A.L.Barabási and Z.N.Oltvai, Network Biology: Understanding the Cell's Functional Organization, Nature Reviews Genetics, 5(2):101-113, 2004 .E. Barabasi, Oltwoy, Network Biology: Understanding the Functional Organization of Cells, Reviews of Nature Genetics, 5(2):101-113, 2004. Literature [3] C.Stark, B.J.Breitkreu...
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
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.