CN107688629A - The visualization compression method of interworking architecture between a kind of multi-type network - Google Patents
The visualization compression method of interworking architecture between a kind of multi-type network Download PDFInfo
- Publication number
- CN107688629A CN107688629A CN201710719011.9A CN201710719011A CN107688629A CN 107688629 A CN107688629 A CN 107688629A CN 201710719011 A CN201710719011 A CN 201710719011A CN 107688629 A CN107688629 A CN 107688629A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- corporations
- key
- neighbor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/174—Redundancy elimination performed by the file system
- G06F16/1744—Redundancy elimination performed by the file system using compression, e.g. sparse files
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/23—Clustering techniques
Abstract
The present invention discloses a kind of visualization compression method of interworking architecture between multi-type network, using node betweenness, this network topology parameters filters out key node to retain the interworking architecture between multi-type network, in order to become apparent from that network is visualized, next node in addition to key node in network is subjected to corporations' merging, and with all nodes included in the corporations after each final merging in a new node alternative networks.The present invention can largely be compressed while interworking architecture between retaining network to the node in network and side.
Description
Technical field
The invention belongs to Network Science field, it is related to a kind of visualization compression method of interworking architecture between multi-type network.
Background technology
Network Science (Network Science) is specialize in the qualitative of complex networks system and quantitative rule one
Brand-new interdisciplinary science, real-life society, economic, biology and physical system are abstracted as and are made up of node and Lian Bian by it
Complex network, then its architectural feature, Dynamic Evolution etc. are studied.It has passed through the development of more than ten years, network section
Learn research and obtained a large amount of achievements, form more perfect subject base and theoretical system.Current most complexity
Network research is all that the system in real world is abstracted as into a network, with deepening continuously for research in this several years, researcher
It was found that isolate between sorts of systems in real world and non-fully, but there is certain contact.For example, air line and iron
Compound, the real-life interpersonal relationship of server and terminal system and online in the compound of road system, computer network
It is compound etc. between interpersonal relationship.Therefore, the research center of gravity of complex network gradually turns to multilayer by single layer network in recent years
Network.Multitiered network (Multilayer Network) be by multiple networks or with different behaviors, attribute entity between
The network that interaction is formed, it is the extension of complex network, and common multitiered network has more d type multitiered networks, interdependent type Multilayer Network
Network etc..Multitiered network is still at an early stage at present, but has caused the concern and attention of domestic and international researcher, and future will turn into
The important directions of Research of network science.
The maturation of visualization technique, study complex network for us and bring facility.Network in real world, it is most of
Node influences less on the overall topological structure of network, and only a small number of important nodes determine the topological structure of network.Based on this sight
Point, complex network compression algorithm have been introduced among visualization.The present invention proposes a kind of based on key node and corporations' conjunction
And visualization compression algorithm.This method can retain more while nodes and side are carried out and largely compressed
Complex network information content.
The content of the invention
The present invention is directed to the visualization of interworking architecture between multi-type network, it is proposed that interaction frame between a kind of multi-type network
The visualization compression method of structure.
The present invention adopts the following technical scheme that：
The visualization compression method of interworking architecture, comprises the following steps between a kind of multi-type network：
Step 1, calculate betweenness value in single layer network of each node in the multi-type network with interworking architecture and every
Betweenness value of the individual node in the whole Internet；
Step 2, using the betweenness value select key node；
Step 3, node in addition to key node in network carries out to corporations' merging, and with a new node alternative networks
In it is each final merge after corporations in all nodes for including.
Preferably, step 2 specifically includes：
Step 2.1, respectively take half critical for whole complex network as each node step 1 income value
Criterion；
Step 2.2, income value in step 2.1 sorted by size, take preceding 10% to be remained as key node, do not enter
Row merges.
Preferably, step 3 specifically includes
Step 3.1 as, a corporations are each individually regarded to remaining node in complex network in addition to key node；
The non-key node that the number of degrees are 1 in step 3.2, search whole network, i.e., only neighbor node is non-key
Node, the corporations being classified to where its neighbor node；If its neighbor node is key node, no longer the point is closed
And it is deleted from network；
Step 3.3, the non-key node for being more than 1 for the number of degrees, that is, have the non-key node of multiple neighbor nodes, find it
The maximum neighbor node of cluster coefficients；
Step 3.4, the public neighbours for finding out non-key node of the number of degrees more than 1 neighbor node maximum with its cluster coefficients
Node set；
If the public neighbours of the non-key node of step 3.5, the number of degrees more than 1 neighbor node maximum with its cluster coefficients save
Point set is not sky, then by wherein for belonging to whole complex network betweenness minimum public-neighbor and the non-key node
Corporations merge；If public-neighbor collection is combined into sky, the non-key affiliated corporations of node are not changed；
Step 3.6, repeat step 3.3, step 3.4, step 3.5, until all non-key affiliated corporations of node no longer change
Become, i.e., all non-key nodes determine final corporations；
Step 3.7, this corporation will be replaced with a new node after all knot removals for belonging to same corporations,
These new nodes have collectively constituted the network after compression with the key node in former network.
Preferably, in step 1, " betweenness ", referring to node betweenness, it is defined as all shortest paths in network
The number in the middle path by the node accounts for the ratio of shortest path sum.
Preferably, in step 3.1, " corporations ", refer to that the node in network is segmented into multiple groups, organize internal segment
Connection between point is denser, organizes the connection between intermediate node than sparse.
Preferably, in step 3.6, " all non-key affiliated corporations of node no longer change ", if referring to merge
There is overlapping node between corporations afterwards, then merge these corporations again, ensure that a node is pertaining only to a corporations.
The present invention using node betweenness this network topology parameters filters out key node to retain between multi-type network
Interworking architecture, in order to become apparent from that network is visualized, next the node in network in addition to key node is entered
Row corporations merge, and with all nodes included in the corporations after each final merging in a new node alternative networks.Through reality
Trample and show, the present invention can largely be compressed while interworking architecture between retaining network to the node in network and side.
Brief description of the drawings
Fig. 1 is the schematic flow sheet for visualizing compression method of interworking architecture between a kind of multi-type network of the present invention.
Embodiment
In order that those skilled in the art are better understood from the present invention program, below in conjunction with the accompanying drawing pair in the present invention
The embodiment of the present invention program is described in detail.
The visualization compression method of interworking architecture between a kind of multi-type network of the present invention, can between network is retained interworking architecture
While the node in network and side are largely compressed, can between multi-type network interworking architecture visual research band
Carry out great convenience.
As shown in figure 1, between a kind of multi-type network interworking architecture visualization compression method, comprise the following steps：
Step 1, calculate each betweenness value of the node in single layer network in the multi-type network with interworking architecture；
Step 2, calculate each betweenness value of the node in the whole Internet in the multi-type network with interworking architecture；
Step 3, half is respectively taken to be closed as each node for whole complex network step 1 and step 2 income value
The criterion of key；
Step 4, income value in step 3 sorted by size, take preceding 10% as interworking architecture between network can be retained
Key node remains, without merging；
Step 5 as, a corporations are each individually regarded to remaining node in complex network in addition to key node；
The non-key node that the number of degrees are 1 in step 6, search whole network, i.e., the non-key section of only one neighbor node
Point, the corporations being classified to where its neighbor node；If its neighbor node is key node, then it is assumed that the point is for whole complicated
The effect of network is extremely small, no longer the point is merged, but it is deleted from network；
Step 7, the non-key node for being more than 1 for the number of degrees, that is, have the non-key node of multiple neighbor nodes, it is poly- to find it
The maximum neighbor node of class coefficient；
Because what cluster coefficients were portrayed be the node neighbor node between the tightness degree that connects, be to judge complex network
Important indicator with " worldlet " attribute, so the node contacts around the node of Local Clustering coefficient maximum are more close,
More likely there is similitude.
Step 8, the public neighbours section for finding out non-key node of the number of degrees more than 1 neighbor node maximum with its cluster coefficients
Point set；
If the public-neighbor of the non-key node of step 9, the number of degrees more than 1 neighbor node maximum with its cluster coefficients
Set is not sky, then by wherein for the minimum public-neighbor of whole complex network betweenness and the non-key affiliated society of node
Group merges；If public-neighbor collection is combined into sky, the non-key affiliated corporations of node are not changed；
According to the GN algorithms from Girvan and Newman propositions：If a line is connected to Liang Ge corporations, belong to not
The side can repeatedly be passed through with the shortest path between the node of corporations, the node at this edge both ends can also have higher betweenness
Value.Therefore from the point of view of conversely, the side being subordinated between the node of identical corporations has less betweenness.
Step 10, repeat step 7, step 8, step 9, until all non-key affiliated corporations of node no longer change, i.e. institute
There is non-key node that final corporations are determined；
If having overlapping node between the corporations after merging, these corporations are merged again, ensure that a node only belongs to
In a corporations.
This corporation is represented with a new node after step 11, all knot removals that same corporations will be belonged to,
These new nodes have collectively constituted the network after compression with the key node in former network.
Further, in step 1, described " betweenness ", refers to node betweenness, and it is defined as in network in all shortest paths
The ratio of shortest path sum is accounted for by the number in the path of the node.
Further, in steps of 5, described " corporations ", refer to that the node in network is segmented into multiple groups, organize between interior nodes
Connection it is denser, organize intermediate node between connection than sparse.
Further, in step 10, described " all non-key affiliated corporations of node no longer change ", if referring to after merging
There is overlapping node between corporations, then merge these corporations again, ensure that a node is pertaining only to a corporations.
It is between a kind of multi-type network of the present invention the advantages of visualization compression method of interworking architecture：This algorithm can be
The company side between the node and node in network is largely compressed while interworking architecture between guarantee network, is polymorphic type
The great convenience that the visualization of interworking architecture is brought between network.
Above example is only the exemplary embodiment invented, and is not used in limitation invention, protection scope of the present invention is by weighing
Sharp claim limits.Those skilled in the art can make various repair to the present invention in the essence and protection domain of the present invention
Change or equivalent substitution, this modification or equivalent substitution also should be regarded as being within the scope of the present invention.
Claims (6)
1. the visualization compression method of interworking architecture between a kind of multi-type network, it is characterised in that comprise the following steps：
Step 1, calculate betweenness value and each section of each node in single layer network in the multi-type network with interworking architecture
Betweenness value of the point in the whole Internet；
Step 2, using the betweenness value select key node；
Step 3, node in addition to key node in network carries out to corporations' merging, and with a new node alternative networks often
All nodes included in corporations after individual final merging.
2. the visualization compression method of interworking architecture between multi-type network as claimed in claim 1, it is characterised in that step 2
Specifically include：
Step 2.1, respectively take half as each node for the critical measurement of whole complex network step 1 income value
Standard；
Step 2.2, income value in step 2.1 sorted by size, take preceding 10% to be remained as key node, without closing
And.
3. the visualization compression method of interworking architecture between multi-type network as claimed in claim 1, it is characterised in that step 3
Specifically include
Step 3.1 as, a corporations are each individually regarded to remaining node in complex network in addition to key node；
The non-key node that the number of degrees are 1 in step 3.2, search whole network, i.e., the non-key node of only one neighbor node,
The corporations being classified to where its neighbor node；If its neighbor node is key node, no longer the point is merged, by it
Deleted from network；
Step 3.3, the non-key node for being more than 1 for the number of degrees, that is, have the non-key node of multiple neighbor nodes, find its cluster
The maximum neighbor node of coefficient；
Step 3.4, the public-neighbor for finding out non-key node of the number of degrees more than 1 neighbor node maximum with its cluster coefficients
Set；
If the public-neighbor collection of the non-key node of step 3.5, the number of degrees more than 1 neighbor node maximum with its cluster coefficients
Close not to be empty, then by wherein for the minimum public-neighbor of whole complex network betweenness and the non-key affiliated corporations of node
Merge；If public-neighbor collection is combined into sky, the non-key affiliated corporations of node are not changed；
Step 3.6, repeat step 3.3, step 3.4, step 3.5, until all non-key affiliated corporations of node no longer change, i.e.,
All non-key nodes determine final corporations；
Step 3.7, this corporation will be replaced with a new node after all knot removals for belonging to same corporations, these
New node has collectively constituted the network after compression with the key node in former network.
4. the visualization compression method of interworking architecture between a kind of multi-type network as claimed in claim 1, it is characterised in that
In step 1, " betweenness ", refer to node betweenness, it is defined as the path for passing through the node in network in all shortest paths
Number account for shortest path sum ratio.
5. the visualization compression method of interworking architecture between a kind of multi-type network as claimed in claim 3, it is characterised in that
In step 3.1, " corporations ", referring to that the node in network is segmented into multiple groups, the connection organized between interior nodes is denser,
Connection between group intermediate node is than sparse.
6. the visualization compression algorithm of interworking architecture between a kind of multi-type network as claimed in claim 3, it is characterised in that
In step 3.6, " all non-key affiliated corporations of node no longer change ", if referring to there is overlapping section between the corporations after merging
Point, then these corporations are merged again, ensure that a node is pertaining only to a corporations.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710719011.9A CN107688629B (en) | 2017-08-21 | 2017-08-21 | Visual compression method for interactive architecture among multiple types of networks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710719011.9A CN107688629B (en) | 2017-08-21 | 2017-08-21 | Visual compression method for interactive architecture among multiple types of networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107688629A true CN107688629A (en) | 2018-02-13 |
| CN107688629B CN107688629B (en) | 2021-02-26 |
Family
ID=61153483
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710719011.9A Active CN107688629B (en) | 2017-08-21 | 2017-08-21 | Visual compression method for interactive architecture among multiple types of networks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107688629B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102073700A (en) * | 2010-12-30 | 2011-05-25 | 浙江大学 | Discovery method of complex network community |
| US20130138479A1 (en) * | 2010-05-24 | 2013-05-30 | Telefonaktiebolaget Lm Ericsson (Publ) | Classification of network users based on corresponding social network behavior |
| CN105550191A (en) * | 2015-07-10 | 2016-05-04 | 成都信息工程大学 | Node importance ranking method for multi-layer network |
-
2017
- 2017-08-21 CN CN201710719011.9A patent/CN107688629B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130138479A1 (en) * | 2010-05-24 | 2013-05-30 | Telefonaktiebolaget Lm Ericsson (Publ) | Classification of network users based on corresponding social network behavior |
| CN102073700A (en) * | 2010-12-30 | 2011-05-25 | 浙江大学 | Discovery method of complex network community |
| CN105550191A (en) * | 2015-07-10 | 2016-05-04 | 成都信息工程大学 | Node importance ranking method for multi-layer network |
Non-Patent Citations (3)
| Title |
|---|
| ALBERT SOLÉ-RIBALTA等: "Centrality Rankings in Multiplex Networks", 《PROCEEDINGS OF THE 2014 ACM CONFERENCE ON WEB SCIENCE》 * |
| KIM, J等: "Differential Flattening: A Novel Framework for Community Detection in Multi-Layer Graphs", 《ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY》 * |
| 李甜甜: "大规模网络布局压缩算法及加速研究", 《中国优秀硕士学位论文全文数据库 基础科学辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107688629B (en) | 2021-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lozano et al. | Complex network analysis of keywords co-occurrence in the recent efficiency analysis literature | |
| Deng et al. | AirVis: Visual analytics of air pollution propagation | |
| CN111309824B (en) | Entity relationship graph display method and system | |
| CN110532436B (en) | Cross-social network user identity recognition method based on community structure | |
| US10078802B2 (en) | Method and system of discovering and analyzing structures of user groups in microblog | |
| CN106326585B (en) | Prediction analysis method and device based on Bayesian Network Inference | |
| US8605092B2 (en) | Method and apparatus of animation planning for a dynamic graph | |
| Pham et al. | A general model for out-of-town region recommendation | |
| CN109299811A (en) | A method of the identification of fraud clique and Risk of Communication prediction based on complex network | |
| CN103399858A (en) | Socialization collaborative filtering recommendation method based on trust | |
| CN107357846A (en) | The methods of exhibiting and device of relation map | |
| CN103795613A (en) | Method for predicting friend relationships in online social network | |
| Hu et al. | Trade structure and risk transmission in the international automotive Li-ion batteries trade | |
| CN105893637A (en) | Link prediction method in large-scale microblog heterogeneous information network | |
| CN112000763B (en) | Method, device, equipment and medium for determining competition relationship of interest points | |
| CN111445320B (en) | Target community identification method and device, computer equipment and storage medium | |
| CN115565232A (en) | Power distribution room switch cabinet face part identification method based on improved YOLOv5 algorithm | |
| Chen et al. | Follow whom? Chinese users have different choice | |
| CN110705045A (en) | Link prediction method for constructing weighting network by using network topological characteristics | |
| CN112949748A (en) | Dynamic network anomaly detection algorithm model based on graph neural network | |
| CN112183820A (en) | Linear programming based directed network link prediction method | |
| CN107688629A (en) | The visualization compression method of interworking architecture between a kind of multi-type network | |
| CN109218184B (en) | Router attribution AS identification method based on port and structure information | |
| Lee et al. | Towards discovering emerging technologies based on decision tree | |
| CN115221779A (en) | Meta-graph-based industrial production relation heterogeneous network feature learning method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |