CN105959132A - Community layout visualization method facing large scale network - Google Patents
Community layout visualization method facing large scale network Download PDFInfo
- Publication number
- CN105959132A CN105959132A CN201610251589.1A CN201610251589A CN105959132A CN 105959132 A CN105959132 A CN 105959132A CN 201610251589 A CN201610251589 A CN 201610251589A CN 105959132 A CN105959132 A CN 105959132A
- Authority
- CN
- China
- Prior art keywords
- node
- community
- gravitation
- layout
- large scale
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/22—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks comprising specially adapted graphical user interfaces [GUI]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Human Computer Interaction (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a community layout visualization method facing a large scale network, relating to the field of information visualization. On the basis of a force guiding layout, a hierarchical spatial decomposition model is introduced, and the computing time complexity of the repulsion force between nodes is reduced. A node degree controls the magnitude of node repulsion, thus the nodes with large degrees are far away from each other, and a community structure is clear. The community gravitation model is optimized, the computing time complexity of the community gravitation is reduced, and the method can be suitable for the community layout of a large scale network. For a node overlapping problem, the repulsion and gravitational force between overlapping nodes are adjusted, and the excessive gathering of the nodes is prevented. According to the method, the community structure information of a large scale network can be displayed, and the method is easy and simple to realize, and the layout speed is fast.
Description
Technical field
The invention belongs to information visualization field, a kind of can show the visual of community structure in large scale network
Change placement algorithm.
Background technology
Visual layout is the important component part in information visualization, is maximized by research visual layout algorithm
Present network structure clearly, be to improve visualization at present draw effect and be convenient for people to understand the effective way of data message.
Community structure is the key property of network, is the most also to analyze and the breach of research large-scale data.By placement algorithm exhibition
Show that community structure information, beneficially people are analyzed and understands large scale network data.Existing power guidance method does not accounts for network
Community structure information, it is impossible to show the community information in network.Guide visual layout method mostly cannot to solve power
Showing that complex network has this characteristic of community structure, researchers are by combining community's partitioning algorithm, it is proposed that concrete solution
Certainly scheme.
Zhu Zhiliang et al. delivered on " computer-aided design with graphics journal " volume 23 o. 11th entitled " based on
The network topology structure visual layout algorithm that complex network community divides " article, this article proposes a kind of to be drawn based on community
The network topology algorithm divided.This algorithm carries out community first with complex network community discovery algorithm to the node in network and draws
Point, by abstract for each community be a node, build new network with the limit that is associated as between community.True according to Physical analogy method
Determine community center position, rely on community's scale simultaneously and determine the layout scope of community, afterwards by condition preferentially by the way of fill
Network topology layout in community.
The Chinese invention patent of Publication No. CN101741623A discloses the network visualization of a kind of networking technology area
Method.The method uses community division method based on modularity index network to be carried out distinguishing hierarchy, according to existing community
Network is preferentially clustered by division methods, is laid out according to division result.The middle promulgated by the State Council of Publication No. CN104217073A
Bright patent discloses visual layout's method that a kind of Web Community gravitation guides.The method adds on the basis of power guiding algorithm
Ru Liao community gravitation, introduces K-means algorithm in community's gravitation, it is achieved complete the cluster of node while layout.
Existing community layout method has the disadvantage in that community's gravitation modeling complexity in (1) algorithm, and computational efficiency is low；(2)
Algorithm steps is complicated, is not suitable for large scale network layout.
Summary of the invention
Deficiency for above technology, it is proposed that a kind of community's gravitation that optimizes models, and reduces the calculating time of community's gravitation
Community's layout method for visualizing towards large scale network of complexity；Technical scheme is as follows: a kind of towards big rule
Community's layout method for visualizing of lay wire network, it comprises the following steps:
101, obtain the locus of community network interior joint, node is carried out spatial decomposition, calculates the degree of node simultaneously
Number；
102, the number of degrees of the node obtained according to step 101 and locus, determine the gravitation between node and repulsion；
103, the community division result obtained according to community discovery algorithm, calculate Nei You limit, same community be connected node it
Between community's gravitation；
104, the node gravitation that obtains according to step 102, repulsion and and community's gravitation of obtaining of step 103, calculate node
Position so that the node in same community is mutually gathered, and the node in different communities is separated from each other, when system temperature reaches
Community's layout is completed during little value.
Further, step 101 utilizes hierarchical space decomposition method that node is carried out spatial decomposition, comprises limit in each space
The node of determined number, all nodes in space are externally considered as a super node, and the number of degrees of super node are this hierarchical space
The number of degrees sum of interior all nodes.
Further, step 101 calculates the number of degrees of node particularly as follows: calculate node according to the structural information of network
Out-degree and in-degree, the number of degrees of node are node out-degree and in-degree sum.
Further, step 102 calculates the formula of the node gravitation suffered by node and node repulsion particularly as follows: according to node
Number of degrees deg (n), distance d (n between node1,n2) and the weight w (n on limit1,n2), call formula (1) and calculate between node
Gravitation faWith repulsion fr, repulsion is present in all of node pair, gravitation exist only in the adjacent node of structure between；
Wherein k is scalable constant.
Further, step 103 calculates community's gravitation particularly as follows: community's gravitation exists only in same community and has limit phase
Between node even, according to the distance d (n between node1,n2) and the weight w (n on limit1,n2), call formula (2) and calculate community
Gravitation so that the node in same community is mutually gathered, forms community structure；
Further, the layout principles of step 104 node layout is: close between adjacent node, between non-conterminous node
Away from, on this basis, close between adjacent node in same community, the adjustment of system temperature uses simulated annealing principle, is
When system temperature is preferably minimized, layout completes.
Advantages of the present invention and having the beneficial effect that:
The present invention solves community's placement algorithm and is not suitable for the limitation of large scale network layout, simplifies algorithm steps and power
Calculating, optimize the modeling of community gravitation, it is proposed that a kind of community's layout method for visualizing towards large scale network.The method exists
On the basis of power guides layout, introduce spatial decomposition model, reduce the calculating time complexity of repulsion between node.The node number of degrees
Control the size of node repulsion so that being located remotely from each other between the node that the number of degrees are big, community structure becomes apparent from.Optimize community simultaneously
Gravitation models, and reduces the calculating time complexity of community's gravitation, it is possible to be applicable to community's layout of large scale network.
Accompanying drawing explanation
Fig. 1 is that the present invention provides preferred embodiment towards community's layout method flow chart of large scale network；
The layout method of Fig. 2 present invention layout effect on Advogato data set.
Detailed description of the invention
Below in conjunction with accompanying drawing, the invention will be further described:
Shown in Figure 1, whole system is issued to balance in the effect of node repulsion, node gravitation and community's gravitation.Side
Method, on the basis of power guides layout, introduces spatial decomposition model, reduces the calculating time complexity of repulsion between node.Node
The number of degrees control the size of node repulsion so that being located remotely from each other between the node that the number of degrees are big, community structure becomes apparent from.Optimize simultaneously
Community's gravitation modeling, reduces the calculating time complexity of community's gravitation, it is possible to be applicable to community's layout of large scale network.Finally
For node overlapping problem, the repulsion between overlapping nodes and gravitation are adjusted, prevent node from excessively gathering.
If G is a network, being expressed as G (V, E) with node and limit, wherein V is the set { v of n node1,v2,...,
vn, E is the set { e on m bar limit1,e2,...,en, G is divided for k corporations { C1,C2,...,Cn}.If layout is asked
Topic is equivalent to the stressing conditions of object in physics, and the effect three power is issued to balance by that node: internodal repulsion,
Internodal gravitation and community's gravitation.Concrete enforcement step is illustrated in figure 1:
A1: in the starting stage, calculates the number of degrees of node according to the structural information of network, the number of degrees of node by node out-degree and
In-degree determines.
A2: according to the existing position of node, all nodes are carried out spatial decomposition, as utilized hierarchical space decomposition method.Often
Comprising limited number of node in individual space, all nodes in space are externally considered as a super node, the degree of super node
Number is determined by the number of degrees of nodes all in this hierarchical space.
A3: calculate node gravitation suffered by node and node repulsion, gravitation and repulsion are mainly used to the balance of maintenance system
Intersect with reducing limit.Distance d (n between number of degrees deg (n) according to node, node1,n2) and the weight w (n on limit1,n2), adjust
The gravitation f between node is calculated with formula (1)aWith repulsion fr.Repulsion is present in all of node pair, and gravitation exists only in structure
Adjacent node between.
A4: calculate community's gravitation, community's gravitation exists only in same community and has between the node that limit is connected.According to node
Between distance d (n1,n2) and the weight w (n on limit1,n2), call formula (2) and calculate community's gravitation so that in same community
Node is mutually gathered, and forms community structure.
A5: according to above-mentioned calculated node repulsion, node gravitation and community's gravitation, coupling system temperature, calculate joint
The position of some movement.The moving range of layout iteration node progressively can reduce along with the reduction of system temperature every time, works as temperature
When being reduced to a certain degree, layout reaches steady statue.For overlapping node pair, adjust the repulsion between node and node it
Between gravitation, prevent node from excessively gathering.
A6: knot adjustment terminates when the temperature of system reaches given minima, otherwise performs step A2.For temperature
Adjustment, simulated annealing principle can be used, during system initial state, temperature is higher, more slowly reduces temperature, until temperature reaches
Minima.
The layout method of Fig. 2 present invention layout effect on Advogato data set.Have selected public data collection
Advogato tests.Advogato network describes the trust network in social networks, and summit represents user, and limit represents to be used
Trust information between family.This data set comprises 5042 summits and 39227 limits.Layout effect is as shown in Figure 2, it can be seen that
This algorithm can substantially reflect the community structure characteristic of network.
The above embodiment is interpreted as being merely to illustrate the present invention rather than limiting the scope of the invention.?
After the content of the record having read the present invention, the present invention can be made various changes or modifications by technical staff, and these equivalences become
Change and modify and fall into the scope of the claims in the present invention equally.
Claims (7)
1. the community's layout method for visualizing towards large scale network, it is characterised in that comprise the following steps:
101, obtain the locus of community network interior joint, node is carried out spatial decomposition, calculates the number of degrees of node simultaneously；
102, the number of degrees of the node obtained according to step 101 and locus, determine the gravitation between node and repulsion；
103, the community division result obtained according to community discovery algorithm, calculates between the node that Nei You limit, same community is connected
Community's gravitation；
104, the node gravitation that obtains according to step 102, repulsion and and community's gravitation of obtaining of step 103, calculate the position of node
Putting so that the node in same community is mutually gathered, the node in different communities is separated from each other, when system temperature minimizes value
Time complete community's layout.
A kind of community's layout method for visualizing towards large scale network the most according to claim 1, it is characterised in that step
Rapid 101 utilize hierarchical space decomposition method that node carries out spatial decomposition, comprise limited number of node, in space in each space
All nodes be externally considered as a super node, the number of degrees of super node be in this hierarchical space the number of degrees of all nodes it
With.
A kind of community's layout method for visualizing towards large scale network the most according to claim 1 and 2, its feature exists
In, step 101 calculates the number of degrees of node particularly as follows: calculate out-degree and the in-degree of node, joint according to the structural information of network
The number of degrees of point are node out-degree and in-degree sum.
A kind of community's layout method for visualizing towards large scale network the most according to claim 1, it is characterised in that step
Rapid 102 formula calculating node gravitation suffered by node and node repulsion particularly as follows: according to number of degrees deg (n) of node, node it
Between distance d (n1,n2) and the weight w (n on limit1,n2), call formula (1) and calculate the gravitation f between nodeaWith repulsion fr, repulsion
Be present in all of node pair, gravitation exist only in the adjacent node of structure between；
Wherein k is scalable constant.
A kind of community's layout method for visualizing towards large scale network the most according to claim 1, it is characterised in that step
Community's gravitation is calculated particularly as follows: according to the distance d (n between node in rapid 1031,n2) and the weight w (n on limit1,n2), call public affairs
Formula (2) calculates community's gravitation so that the node in same community is mutually gathered, and forms community structure；
A kind of community's layout method for visualizing towards large scale network the most according to claim 1, it is characterised in that step
The layout principles of rapid 104 node layouts is: close between adjacent node, between non-conterminous node away from, on this basis, same
In community close between adjacent node, the adjustment of system temperature uses simulated annealing principle, when system temperature is preferably minimized, layout
Complete.
A kind of community's layout method for visualizing towards large scale network the most according to claim 6, it is characterised in that step
Rapid 104 according to the node gravitation obtained, repulsion and and community's gravitation of obtaining of step 103 utilize formula (3) and formula (4) calculating
The change information of the position of node, concrete grammar is:
Wherein x1It is n1Abscissa, x2It is n2Abscissa, y1It is n1Vertical coordinate, y2It is n2Vertical coordinate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610251589.1A CN105959132B (en) | 2016-04-21 | 2016-04-21 | A kind of community's layout method for visualizing towards large scale network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610251589.1A CN105959132B (en) | 2016-04-21 | 2016-04-21 | A kind of community's layout method for visualizing towards large scale network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105959132A true CN105959132A (en) | 2016-09-21 |
| CN105959132B CN105959132B (en) | 2019-09-10 |
Family
ID=56917780
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610251589.1A Active CN105959132B (en) | 2016-04-21 | 2016-04-21 | A kind of community's layout method for visualizing towards large scale network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105959132B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107818149A (en) * | 2017-10-23 | 2018-03-20 | 中国科学院信息工程研究所 | A kind of diagram data visual layout optimization method based on power guiding algorithm |
| CN108280550A (en) * | 2018-01-30 | 2018-07-13 | 杭州电子科技大学 | A kind of visual analysis method that relatively public bicycles website community divides |
| CN109245921A (en) * | 2018-08-24 | 2019-01-18 | 电子科技大学 | A kind of network topology structure method for visualizing in irregular area |
| CN109508389A (en) * | 2018-12-19 | 2019-03-22 | 哈尔滨工程大学 | A kind of personnel's social relationships map visualization accelerated method |
| CN110853120A (en) * | 2019-10-09 | 2020-02-28 | 上海交通大学 | Network layout method, system and medium based on segmentation and drawing method |
| CN115001935A (en) * | 2022-06-23 | 2022-09-02 | 集智学园（北京）科技有限公司 | Hierarchical layout method of large-scale network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741623A (en) * | 2009-11-23 | 2010-06-16 | 上海交通大学 | Method for network visualization |
| CN103024017A (en) * | 2012-12-04 | 2013-04-03 | 武汉大学 | Method for distinguishing important goals and community groups of social network |
| CN104217073A (en) * | 2014-08-26 | 2014-12-17 | 重庆邮电大学 | Network association gravitation-directed visualization layout method |
-
2016
- 2016-04-21 CN CN201610251589.1A patent/CN105959132B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101741623A (en) * | 2009-11-23 | 2010-06-16 | 上海交通大学 | Method for network visualization |
| CN103024017A (en) * | 2012-12-04 | 2013-04-03 | 武汉大学 | Method for distinguishing important goals and community groups of social network |
| CN104217073A (en) * | 2014-08-26 | 2014-12-17 | 重庆邮电大学 | Network association gravitation-directed visualization layout method |
Non-Patent Citations (3)
| Title |
|---|
| 吴渝 等: "展示复杂网络社团结构的社团引力导引的布局算法", 《计算机辅助设计与图形学学报》 * |
| 孔兵: "基于连接度量的社区发现研究", 《中国优秀博士学位论文全文数据库》 * |
| 郑荣辉: "社会网络关系可视化分析系统的设计与实现", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107818149A (en) * | 2017-10-23 | 2018-03-20 | 中国科学院信息工程研究所 | A kind of diagram data visual layout optimization method based on power guiding algorithm |
| CN107818149B (en) * | 2017-10-23 | 2021-10-08 | 中国科学院信息工程研究所 | Graph data visualization layout optimization method based on force guidance algorithm |
| CN108280550A (en) * | 2018-01-30 | 2018-07-13 | 杭州电子科技大学 | A kind of visual analysis method that relatively public bicycles website community divides |
| CN108280550B (en) * | 2018-01-30 | 2020-06-09 | 杭州电子科技大学 | Visual analysis method for comparing community division of public bicycle stations |
| CN109245921A (en) * | 2018-08-24 | 2019-01-18 | 电子科技大学 | A kind of network topology structure method for visualizing in irregular area |
| CN109508389A (en) * | 2018-12-19 | 2019-03-22 | 哈尔滨工程大学 | A kind of personnel's social relationships map visualization accelerated method |
| CN109508389B (en) * | 2018-12-19 | 2021-05-28 | 哈尔滨工程大学 | Visual accelerating method for personnel social relationship map |
| CN110853120A (en) * | 2019-10-09 | 2020-02-28 | 上海交通大学 | Network layout method, system and medium based on segmentation and drawing method |
| CN110853120B (en) * | 2019-10-09 | 2023-05-19 | 上海交通大学 | Network layout method, system and medium based on segmentation drawing method |
| CN115001935A (en) * | 2022-06-23 | 2022-09-02 | 集智学园（北京）科技有限公司 | Hierarchical layout method of large-scale network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105959132B (en) | 2019-09-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105959132A (en) | Community layout visualization method facing large scale network | |
| Zhang et al. | Generative design and performance optimization of residential buildings based on parametric algorithm | |
| CN104217073A (en) | Network association gravitation-directed visualization layout method | |
| Martinovic et al. | Bayesian grammar learning for inverse procedural modeling | |
| CN104268943B (en) | Fluid simulation method based on Eulerian-Lagrangian coupling method | |
| CN106021824B (en) | A kind of application method of certainty finite element software in or large and complex structure analysis simple containing interval parameter | |
| Matarazzo et al. | STRIDE for structural identification using expectation maximization: Iterative output-only method for modal identification | |
| CN109190461B (en) | A kind of dynamic gesture identification method and system based on gesture key point | |
| CN106294664A (en) | Method and device for generating thinking guide graph | |
| CN108733876A (en) | Fire develops emulation mode and the fire evacuation comprehensive simulating method including it | |
| CN104680573A (en) | Texture mapping method based on triangular mesh simplification | |
| CN107665269A (en) | Quick crowd evacuation emulation method and device based on geography information | |
| CN110502803A (en) | Wiring method and device based on BIM technology | |
| CN110362927A (en) | A kind of BIM model light-weight technologg method and system that multilayer optimizes step by step | |
| CN103080941A (en) | Apparatus for generating computational data, method for generating computational data, and program for generating computational data | |
| CN107351081A (en) | Redundancy mechanical arm impact degree layer motion planning method with speed-optimization characteristic | |
| CN106934422A (en) | Hierarchical visual abstraction method based on improved force guide diagram layout | |
| CN106228265A (en) | Based on Modified particle swarm optimization always drag phase transport project dispatching algorithm | |
| CN107992672A (en) | A kind of soft tissue deformation modeling method based on virtual spring | |
| CN106897942A (en) | A kind of power distribution network distributed parallel method for estimating state and device | |
| CN110059637A (en) | A kind of detection method and device of face alignment | |
| CN103366402A (en) | Fast attitude synchronization method of three-dimensional virtual clothing | |
| van Aanholt et al. | Declarative procedural generation of architecture with semantic architectural profiles | |
| CN106709507B (en) | A kind of parallel coordinate system view cluster data binding method of power guiding segmentation bone | |
| CN114913300A (en) | Automatic modeling method for entity three-dimensional model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |