CN105959132B - A kind of community's layout method for visualizing towards large scale network - Google Patents

A kind of community's layout method for visualizing towards large scale network Download PDF

Info

Publication number
CN105959132B
CN105959132B CN201610251589.1A CN201610251589A CN105959132B CN 105959132 B CN105959132 B CN 105959132B CN 201610251589 A CN201610251589 A CN 201610251589A CN 105959132 B CN105959132 B CN 105959132B
Authority
CN
China
Prior art keywords
node
community
gravitation
degree
repulsion
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.)
Active
Application number
CN201610251589.1A
Other languages
Chinese (zh)
Other versions
CN105959132A (en
Inventor
赵润乾
吴渝
李红波
常雨萧
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201610251589.1A priority Critical patent/CN105959132B/en
Publication of CN105959132A publication Critical patent/CN105959132A/en
Application granted granted Critical
Publication of CN105959132B publication Critical patent/CN105959132B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12Discovery or management of network topologies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/22Arrangements 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

A kind of community's layout method for visualizing towards large scale network is claimed in the present invention, is related to information visualization field.The present invention introduces hierarchical space decomposition model, reduces the calculating time complexity of repulsion between node on the basis of power is guided and is laid out.The size of node degree digital control node repulsion, so that being located remotely from each other between the big node of degree, community structure is more clear.Optimize the modeling of community's gravitation, reduce the calculating time complexity of community's gravitation, the community that method can be suitable for large scale network is laid out.For node overlapping problem, between overlapping nodes repulsion and gravitation adjust, prevent node from excessively gathering.The present invention can not only show the community structure information of large scale network, also simply, be easily achieved and be laid out the advantages that speed is fast.

Description

A kind of community's layout method for visualizing towards large scale network
Technical field
It is specifically a kind of to show the visual of community structure in large scale network the invention belongs to information visualization field Change placement algorithm.
Background technique
Visual layout is the important component in information visualization, is maximized by research visual layout's algorithm Clearly network structure is presented, is to improve visualization at present to draw effect and conveniently it is appreciated that the effective way of data information. Community structure is the key property of network, while being also the breach for analyzing and studying large-scale data.Pass through placement algorithm exhibition Show community structure information, be conducive to people's analysis and understand large scale network data.Existing power guidance method does not account for network Community structure information, can not show the community information in network.Mostly can not to solve power guiding visual layout's method Show that complex network has this characteristic of community structure, researchers propose specific solution by combining community's partitioning algorithm Certainly scheme.
Zhu Zhiliang et al. has delivered entitled " be based on " CAD and graphics journal " o. 11th of volume 23 The article of the network topology structure visual layout algorithm that complex network community divides ", this article propose a kind of based on community stroke The network topology algorithm divided.The algorithm carries out community to the node in network first with complex network community discovery algorithm and draws Point, each community is abstracted as a node, new network is constructed with the side that is associated as between community.It is true according to Physical analogy method Determine community center position, while relying on the layout range that community's scale determines community, later condition preferentially by way of fill Network topology layout in community.
The Chinese invention patent of Publication No. CN101741623A discloses a kind of network visualization of network technique field Method.This method carries out distinguishing hierarchy to network using the community division method based on modularity index, according to existing community Division methods preferentially cluster network, are laid out according to division result.The middle promulgated by the State Council of Publication No. CN104217073A Bright patent discloses a kind of visual layout's method of Web Community's gravitation guiding.This method adds on the basis of power guiding algorithm The community Ru Liao gravitation, K-means algorithm is introduced into community's gravitation, realizes the cluster that node is completed while layout.
Existing community's layout method has the disadvantage in that gravitation modeling in community's is complicated in (1) algorithm, and computational efficiency is low;(2) Algorithm steps are complicated, are not suitable for large scale network layout.
Summary of the invention
For the deficiency of the above technology, a kind of optimization community's gravitation modeling is proposed, the calculating time of community's gravitation is reduced The community towards large scale network of complexity is laid out method for visualizing;Technical scheme is as follows: a kind of towards big rule The community of lay wire network is laid out method for visualizing comprising following steps:
101, the spatial position for obtaining community network interior joint, carries out spatial decomposition, while the degree of calculate node for node Number;
102, the degree of the node obtained according to step 101 and spatial position determine gravitation and repulsion between node;
103, the community division result obtained according to community discovery algorithm, calculate the connected node in the side same community Nei You it Between community's gravitation;
104, node gravitation, repulsion and the community's gravitation obtained with step 103 obtained according to step 102, calculate node Position so that the node in same community is mutually gathered, the node in different communities is separated from each other, when system temperature reaches most Community's layout is completed when small value.
Further, node is carried out spatial decomposition using hierarchical space decomposition method by step 101, includes limit in each space The node of fixed number amount, all nodes in space are externally considered as a super node, and the degree of super node is the hierarchical space The sum of the degree of interior all nodes.
Further, step 101 calculates the degree of calculate node specifically: according to the structural information calculate node of network Out-degree and in-degree, the degree of node are the sum of node out-degree and in-degree.
Further, the formula of node gravitation and node repulsion suffered by step 102 calculate node specifically: according to node Degree deg (n), the distance between node d (n1,n2) and side weight w (n1,n2), it calls between formula (1) calculate node Gravitation faWith repulsion fr, repulsion is present in all nodes pair, and gravitation exists only between the adjacent node pair of structure;
Wherein k is adjustable constant.
Further, community's gravitation is calculated in step 103 specifically: community's gravitation exists only in same community and has side phase Between node even, according to the distance between node d (n1,n2) and side weight w (n1,n2), call formula (2) to calculate community Gravitation forms community structure so that the node in same community is mutually gathered;
Further, the layout principles of step 104 node layout are as follows: it is close between adjacent node, between non-conterminous node Separate, 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 is completed.
It advantages of the present invention and has the beneficial effect that:
The present invention solves the limitation that community's placement algorithm is not suitable for large scale network layout, simplifies algorithm steps and power Calculating, optimization community's gravitation modeling, propose it is a kind of towards large scale network community layout method for visualizing.This method exists On the basis of power guiding layout, spatial decomposition model is introduced, the calculating time complexity of repulsion between node is reduced.Node degree The size of control node repulsion, so that being located remotely from each other between the big node of degree, community structure is more clear.Optimize community simultaneously Gravitation modeling, reduces the calculating time complexity of community's gravitation, and the community that can be suitable for large scale network is laid out.
Detailed description of the invention
Fig. 1 is that the present invention provides community layout method flow chart of the preferred embodiment towards large scale network;
The layout effect of layout method Fig. 2 of the invention on Advogato data set.
Specific embodiment
Below in conjunction with attached drawing, the invention will be further described:
Shown in Figure 1, whole system reaches balance under the action of node repulsion, node gravitation and community's gravitation.Side Method introduces spatial decomposition model, reduces the calculating time complexity of repulsion between node on the basis of power is guided and is laid out.Node The size of degree control node repulsion, so that being located remotely from each other between the big node of degree, community structure is more clear.Optimize simultaneously The modeling of community's gravitation, reduces the calculating time complexity of community's gravitation, and the community that can be suitable for large scale network is laid out.Finally For node overlapping problem, between overlapping nodes repulsion and gravitation adjust, prevent node from excessively gathering.
If G is a network, it is expressed as G (V, E) with node and side, wherein V is the set { v of n node1,v2,..., vn, E is the set { e on m side1,e2,...,en, G is divided for k corporations { C1,C2,...,Cn}.If layout asked Topic is equivalent to the stress condition of object in physics, that node will reach balance under the action of three power: repulsion between node, Gravitation and community's gravitation between node.Specific implementation steps are as shown in Figure 1 are as follows:
A1: in the initial stage, according to the degree of the structural information calculate node of network, the degree of node by node out-degree and In-degree determines.
A2: according to the existing position of node, spatial decomposition is carried out to all nodes, such as utilizes hierarchical space decomposition method.Often It include limited number of node in a space, all nodes in space are externally considered as a super node, the degree of super node Number is determined by the degree of all nodes in the hierarchical space.
A3: node gravitation and node repulsion suffered by calculate node, gravitation and repulsion are mainly used to the balance of maintenance system Intersect with side is reduced.According to the distance between the degree deg (n) of node, node d (n1,n2) and side weight w (n1,n2), it adjusts With the gravitation f between formula (1) calculate nodeaWith repulsion fr.Repulsion is present in all nodes pair, and gravitation exists only in structure Between adjacent node pair.
A4: calculating community's gravitation, community's gravitation exist only in same community and have side connected node between.According to node The distance between d (n1,n2) and side weight w (n1,n2), call formula (2) to calculate community's gravitation, so that in same community Node is mutually gathered, and community structure is formed.
A5: section is calculated in conjunction with system temperature according to the above-mentioned node repulsion being calculated, node gravitation and community's gravitation The mobile position of point.The moving range of layout iteration node can be gradually reduced with the reduction of system temperature every time, work as temperature When reducing to a certain extent, layout reaches stable state.For the node pair of overlapping, adjust repulsion between node and node it Between gravitation, prevent node from excessively gathering.
A6: when the temperature of system reaches given minimum value, node adjustment terminates, no to then follow the steps A2.For temperature Adjustment, simulated annealing principle can be used, temperature is higher when system initial state, then slowly reduces temperature, until temperature reaches Minimum value.
The layout effect of layout method Fig. 2 of the invention on Advogato data set.Public data collection is selected Advogato is tested.Advogato network describes the trust network in social networks, and vertex represents user, and side, which represents, to be used Trust information between family.The data set includes 5042 vertex and 39227 sides.It is as shown in Figure 2 to be laid out effect, it can be seen that The algorithm can obviously reflect the community structure characteristic of network.
The above embodiment is interpreted as being merely to illustrate the present invention rather than limit the scope of the invention.? After the content for having read record of the invention, technical staff can be made various changes or modifications the present invention, these equivalent changes Change and modification equally falls into the scope of the claims in the present invention.

Claims (4)

1. a kind of community towards large scale network is laid out method for visualizing, which comprises the following steps:
101, the spatial position for obtaining community network interior joint, carries out spatial decomposition, while the degree of calculate node for node;Step Node is carried out spatial decomposition using hierarchical space decomposition method by rapid 101, includes limited number of node in each space, in space All nodes be externally considered as a super node, the degree of super node be all nodes in the hierarchical space degree it With;The degree of step 101 calculating calculate node specifically: according to the out-degree and in-degree of the structural information calculate node of network, section The degree of point is the sum of node out-degree and in-degree;
102, the degree of the node obtained according to step 101 and spatial position determine gravitation and repulsion between node;
103, the community division result obtained according to community discovery algorithm calculates between the connected node in the side same community Nei You Community's gravitation;
104, community's gravitation that node gravitation, repulsion and the step 103 obtained according to step 102 obtains, the position of calculate node, So that the node in same community is mutually gathered, the node in different communities is separated from each other, when system temperature reaches minimum value Complete community's layout, the layout principles of community's layout are as follows: it is close between adjacent node, it is separate between non-conterminous node, in this base Close between adjacent node in same community on plinth, the adjustment of system temperature uses simulated annealing principle, and system temperature drops to most When low, layout is completed.
2. a kind of community towards large scale network according to claim 1 is laid out method for visualizing, which is characterized in that step The formula of node gravitation and node repulsion suffered by rapid 102 calculate node specifically: according to the degree deg (n) of node, node it Between distance d (n1,n2) and side weight w (n1,n2), call the gravitation f between formula (1) calculate nodeaWith repulsion fr, n table Show the number of node, n1、n2Two nodes for respectively indicating same community and having side connected;Repulsion is present in all nodes pair, Gravitation exists only between the adjacent node pair of structure;
Wherein k is adjustable constant.
3. a kind of community towards large scale network according to claim 2 is laid out method for visualizing, which is characterized in that step Community's gravitation is calculated in rapid 103 specifically: according to the distance between node d (n1,n2) and side weight w (n1,n2), it calls public Formula (2) calculates community's gravitation fc, so that the node in same community is mutually gathered, form community structure;
4. a kind of community towards large scale network according to claim 3 is laid out method for visualizing, which is characterized in that step Rapid 104 calculate section using formula (3) and formula (4) according to community's gravitation that obtained node gravitation, repulsion and step 103 obtain The change information of the position of point, specific method is:
Wherein x1It is n1Abscissa, x2It is n2Abscissa, Δ x, Δ y respectively indicate knots modification of the position of node in x-axis Knots modification on the y axis, y1It is n1Ordinate, y2It is n2Ordinate.
CN201610251589.1A 2016-04-21 2016-04-21 A kind of community's layout method for visualizing towards large scale network Active CN105959132B (en)

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 CN105959132A (en) 2016-09-21
CN105959132B true 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)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107818149B (en) * 2017-10-23 2021-10-08 中国科学院信息工程研究所 Graph data visualization layout optimization method based on force guidance algorithm
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
CN109508389B (en) * 2018-12-19 2021-05-28 哈尔滨工程大学 Visual accelerating method for personnel social relationship map
CN110853120B (en) * 2019-10-09 2023-05-19 上海交通大学 Network layout method, system and medium based on segmentation drawing method

Citations (3)

* Cited by examiner, † Cited by third party
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

Patent Citations (3)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
基于连接度量的社区发现研究;孔兵;《中国优秀博士学位论文全文数据库》;20121031;I139-9
展示复杂网络社团结构的社团引力导引的布局算法;吴渝 等;《计算机辅助设计与图形学学报》;20150831;第27卷(第8期);正文第2章
社会网络关系可视化分析系统的设计与实现;郑荣辉;《中国优秀硕士学位论文全文数据库》;20160331;I138-1984

Also Published As

Publication number Publication date
CN105959132A (en) 2016-09-21

Similar Documents

Publication Publication Date Title
CN105959132B (en) A kind of community's layout method for visualizing towards large scale network
CN106685716B (en) Network topology adaptive data visualization method and device
CN104217073B (en) A kind of visual layout's method of network community gravitation guiding
CN109255830A (en) Three-dimensional facial reconstruction method and device
CN105160707B (en) Threedimensional model quick visualization method based on viewpoint index
CN103699678B (en) A kind of hierarchy clustering method based on multistage stratified sampling and system
CN101996242A (en) Three-dimensional R-tree index expansion structure-based three-dimensional city model adaptive method
CN109598279A (en) Based on the zero sample learning method for generating network from coding confrontation
CN102855661B (en) Large-scale forest scene quick generation method based on space similarity
CN104239431B (en) Three-dimension GIS model display methods and device
CN106934422A (en) Based on the level vision abstract method for improving power derivation graph layout
CN105654387B (en) Time-varying network community evolution visualization method introducing quantization index
CN112989028A (en) Knowledge graph layout optimization method based on force-oriented algorithm
CN108876595A (en) A kind of P2P personal credit file method and device based on data mining
Zou et al. Collision detection for virtual environment using particle swarm optimization with adaptive cauchy mutation
CN110532666A (en) Urban micro-climate evolution analysis method based on wind environment variation
CN103366402A (en) Fast attitude synchronization method of three-dimensional virtual clothing
CN109460444A (en) Method and apparatus for output information
CN106802958B (en) Conversion method and system of the CAD data to GIS data
CN103310045A (en) Method for carrying out crystal macromolecule three-dimensional visualization by adopting augmented reality technology
CN109840598A (en) A kind of method for building up and device of deep learning network model
Hua et al. Force-directed graph visualization with pre-positioning-Improving convergence time and quality of layout
CN107644686A (en) Medical data acquisition system and method based on virtual reality
CN103927392B (en) Deep layer network data source abnormal point detection method and system
CN106357461A (en) Measuring method for air traffic display complexity

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