CN106934422A - Based on the level vision abstract method for improving power derivation graph layout - Google Patents

Based on the level vision abstract method for improving power derivation graph layout Download PDF

Info

Publication number
CN106934422A
CN106934422A CN201710157017.1A CN201710157017A CN106934422A CN 106934422 A CN106934422 A CN 106934422A CN 201710157017 A CN201710157017 A CN 201710157017A CN 106934422 A CN106934422 A CN 106934422A
Authority
CN
China
Prior art keywords
node
cluster
formula
abstract
layout
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
Application number
CN201710157017.1A
Other languages
Chinese (zh)
Other versions
CN106934422B (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.)
Zhejiang University of Technology ZJUT
Original Assignee
Zhejiang University of Technology ZJUT
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 Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201710157017.1A priority Critical patent/CN106934422B/en
Publication of CN106934422A publication Critical patent/CN106934422A/en
Application granted granted Critical
Publication of CN106934422B publication Critical patent/CN106934422B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/29Graphical models, e.g. Bayesian networks
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/904Browsing; Visualisation therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/23Clustering techniques
    • G06F18/231Hierarchical techniques, i.e. dividing or merging pattern sets so as to obtain a dendrogram

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Evolutionary Biology (AREA)
  • Evolutionary Computation (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A kind of level vision abstract method based on improvement power derivation graph layout, step is as follows:The first step, using improved power guiding algorithm, has in generation one substantially cluster structure, can embody the preliminary placement of graph structure information;Second step, based on layout result, the hierarchical structure of figure is generated using hierarchy clustering method from bottom to top;3rd step, according to the hierarchical structure of generation, carries out vision abstract in different levels.

Description

Based on the level vision abstract method for improving power derivation graph layout
Technical field
The present invention relates to the graphic display method of network data.
Background technology
Network data refers to the data that can be expressed as graph structure, complicated relation between expression things.From various societies Understand relational network to scientific collaboration network, biological contexts network to computer network etc., human lives are full of various networks The world in.And many networks have the feature in the small-sized world, i.e. these networks have the structure of Local Clustering, they Connectivity high causes that finding a suitable layout and graph structure is difficult to.Node link method is the expression directly perceived of network, with top Put to represent the individuality in network, relation individual and between individuality is represented with side.Things in real world is abstracted into section Point link structure, can effective visual network structure by figure placement algorithm.
Artwork is intended to be a physical system by the figure placement algorithm of power guiding, and node regards steel loop as, while regard spring as, system After being endowed certain original state, the effect of power can cause that steel loop is moved, by successive ignition until finding the position of all nodes Put so that stop when gross energy in this system is minimum, at this moment just reach the dynamic equilibrium of whole layout.It is easy to reason Solution, realizes simply, to be applicable most of Network data sets, and the algorithm realizes that effect has preferable symmetry, than Relatively meet Aesthetic Standards.Also, it can entirely be laid out the process for gradually tending to convergence stabilization with Dynamic Display, so that user is to cloth Office's result is easier to receive and understands.Power guiding algorithm is proposed then have many scholars to attempt introducing at first by Peter Eades Different mechanical models creates more attractive layout, existing comparing it is famous have FR algorithms, DH algorithms and KK algorithms.But It is that the expansion of network data scale causes serious juxtaposition phenomenon, hinders cognition of the user to True Data, it is difficult to examine Survey graphic structure, the contact explored between individuality.Additionally, for the relational network with small-sized world feature, it to be represented Information out is also very limited, or even probably destroys those with the original for disclosing relation and function between network structure and function The cluster that begins structure.LinLog power guiding algorithm connects the degree of coupling between nodal distance and node, is embodied with distance Just, resulting layout result can clearly display the cluster in figure to the degree of coupling.But LinLog algorithms are applied to It is in real network data test result indicate that, since a random original state, it is more easily trapped into than conventional method Local minimum.
The content of the invention
The present invention will overcome the disadvantages mentioned above of prior art, propose it is a kind of based on improve the expansible of power guiding layout can Depending on changing level abstract method, to solve the figure location problem of the complex network with small-sized world feature on a large scale, figure is kept Original structure, while reducing potential VC.Both user can have been allowed to see the general view of figure, had been had to different data distributions Individual overall understanding, it is also possible to finer observation is carried out to local cluster, help finds special point or cluster structure.
The present invention is improved with the advantage of LinLog algorithms with reference to FR algorithms to power guiding algorithm, generates not only attractive in appearance but also energy Keep the preliminary placement of figure cluster structure;Layout result is then based on, using hierarchy clustering method generation figure from bottom to top Hierarchical structure, shows determining the cluster under different levels, it is allowed to which user is more while defining and embodying the parameter of abstract level Individual level observed data architectural feature.
Technical scheme is altogether in three steps:The first step, using improved power guiding algorithm, generation one has Substantially cluster structure, the preliminary placement of graph structure information can be embodied;Second step, based on layout result, using from bottom to top Hierarchy clustering method generates the hierarchical structure of figure;3rd step, according to the hierarchical structure of generation, carries out vision and takes out in different levels As.
A kind of level vision abstract method based on improvement power derivation graph layout, step is as follows:
1. preliminary placement is generated using improved power guiding algorithm.Improved power guiding algorithm be exactly first with FR algorithms from Beginning is put in seat in the plane, and iterate searching state of minimum energy, produces a relatively stable layout, then perform based on the state LinLog algorithms.
1.1 initialization:Primary condition is set, each node v is assignediOne random site pi
1.2 figures based on FR algorithms are laid out
To each node v in figureiMake following iteration:
What 1.2.1 calculate node was subject to makes a concerted effort:A) first calculate node viWith other nodes vjBetween Euclidean distance x=| pi-pj|.B) substitution formula (1) and (2) calculates the gravitation and repulsion from other nodes suffered by the node respectively.C) according to public affairs Formula (3) calculate node viSuffered F (the v that make a concerted efforti)
f(eij)=x2/k (1)
g(vi, vj)=k2/x (2)
Wherein, k=sqrt (A/ | V |), A are the viewing area area of whole view, and | V | is node total number;eijRepresent section Point viWith vjBetween the side that is connected, therefore formula (1) calculate two have the connected node in side between gravitation.Formula (2) calculates at 2 points Between repulsion.In formula (3)Represent the direction of power.
1.2.2 node location updates:Node viAccording to the effect F (v that make a concerted effort abovei) move, reach new position pi'=pi+C*F(vi).Here C is common constant, is the influence coefficient of power.When C is larger, joints influence is big, motion Faster;Vice versa.
1.2.3 iteration termination condition is judged:The gross energy E of whole system, then calculate node iteration are calculated according to formula (4) Energy differences Δ E before and after location updating, when Δ E is continuously less than the threshold value that certain sets, then it is assumed that system reaches stable state, Stop iteration.
Figure layout under 1.3LinLog algorithms
Based on the layout of FR algorithms, the position of each node is recorded, to each node v in figureiMake following iteration:
What 1.3.1 calculate node was subject to makes a concerted effort:A) first calculate node viWith other nodes vjBetween Euclidean distance x=| pi-pj|.B) substitution formula (5) and (6) calculates the gravitation and repulsion from other nodes suffered by the node respectively.C) according to public affairs Formula (3) calculate node viSuffered F (the v that make a concerted efforti)
f(eij)=C1 (5)
g(vi, vj)=C2/x (6)
C in formula1And C2All it is constant.
1.3.2 node location updates:Node viAccording to the effect F (v that make a concerted effort abovei) move, reach new position pi′。
1.3.3 iteration termination condition is judged:The gross energy E of whole system, then calculate node iteration are calculated according to formula (7) Energy differences Δ E before and after location updating, when Δ E is continuously less than the threshold value that certain sets, then it is assumed that system reaches stable state, Stop iteration.
2. the layout result based on power guiding algorithm, generates the hierarchical structure of figure.
2.1 definition cluster c are five-tuple (lc,rc,wc,fc,Vc), wherein lcAnd rcTwo son clusters of cluster are represented respectively In left subgroup and right subgroup, wcIts weights are represented, as (distance can select different degree to the distance between its sub- cluster Amount), fcIt is his father's cluster, VcThen represent original node set in the figure included in the cluster.
All ancestor node v in 2.2 initialization figuresiFor leaf clusters ci(u,u,0,u,vi), u is expressed as sky here, while The position Pc of initialization leaf clusteriIt is the v after exertin guiding layoutiPosition pi
2.3 calculate the distance between cluster.According to the different abstract needs of network data and vision, can select it is different away from Calculated from measurement.
2.3.1 the Euclidean distance r between cluster is calculatedcicj=| Pci-Pcj| as distance metric.
2.3.2 the average path length l between cluster is calculatedcicjAs distance metric.
2.3.3 according to formula (8) by the average path length l between clustercicjWith the Betweenness Centrality C of clusterB(ci) Sum is combined, used as distance metric.
Wherein α ∈ (0,1) are weighting parameter, represent the shared weight in weights of Betweenness Centrality.α is bigger, then intermediary Influence of the centrality to weights is bigger.ΩijIt is node viAnd vjBetween shortest path bar number, Ωij(vk) it is section in these paths Point vkThe number of times of appearance, therefore, CB(vk) represent node vkBetweenness Centrality.Cluster ckBetweenness Centrality CB(ck) poly- for this The average value of the node Betweenness Centrality that class is included.
2.4 select two cluster ciWith cjApart from dijRecently, the new cluster c of generation is merged as left and right subgroupk (ci,cj,dij,u,(Vci∪Vcj)), position PckThen according to the node set Vc that new cluster is includedkThe mean place of interior joint To determine.Meanwhile, newly cluster ckAs ciWith cjFather cluster, ciWith cj(u, u, 0, c are updated to respectivelyk,Vci) and (u, u, 0, ck,Vcj), and by ckAdd and calculate.
2.5 repeat step 2.3 and 2.4 always, find closest cluster and merge repeatedly, until all clusters all Untill merging into a cluster.
3. it is abstract vision to be carried out in different levels.
3.1 will finally merge the cluster c for obtaining when building hierarchical structurerootIt is defined as root cluster
3.2 define abstract level parameter AL ∈ [0,1], with AL × wcrootHierarchical structure is intercepted to spend, only will symbol Conjunction condition wck≤AL×wcroot<wfcCluster be shown on view, complete it is abstract to the vision of network structure.By abstract Level AL's changes to obtain different abstract results.
The present invention describes a kind of level vision abstract method based on improvement power derivation graph layout, by the net of user input Network data are converted into node link figure, then carry out figure layout using improved power guiding algorithm, obtain that graph structure can be embodied The preliminary placement result of information, it is ensured that the layout structure of figure visually overall aesthetic;Layout result is next based on, using several The measurement that what distance, shortest path, shortest path add 3 kinds of Betweenness Centrality different carries out hierarchy clustering method life from bottom to top Into the hierarchical structure of figure, hierarchy clustering method iterates to calculate the similitude between cluster, similitude cluster high is merged.It is logical Cross this merging, while also reducing the quantity on side, can reach taking out for figure by a similar class node aggregation under clustering measure As simplification, decreased while highlighting global structure by data scale becomes the VC for being brought greatly;Additionally, defining Embody the parameter of abstract level and show determining the cluster under different levels, different level of abstractions are drawn according to abstract level parameter Under figure layout result.When abstract level is high, graph abstraction helps stressing main structure, alleviates and perceives burden;Abstract level is low When, the CONSTRUCTED SPECIFICATION of figure can be observed.Therefore this method can be provided from multiple abstraction levels and remove comprehensive understanding graphic structure.
Advantages of the present invention is as follows:
(1) realize simple.The figure layout method used in the present invention is entered on the basis of traditional power guiding placement algorithm Row is improved, and is realized fairly simple.
(2) scalability is good.Hierarchical structure construction method of the invention, can generate not according to different distance metrics Same hierarchical structure, so as to obtain different abstract results, the different structure attribute of protrusion and feature.
(3) applicability is wide.The level vision abstract method that the present invention is realized is applied to the figure of different scales and type, gathers The quantity of class is generated also without previously given by the regulation of parameter in different levels, meets the multiple need of user Will.
(4) multi-angle observation, multi-layer is presented.The level vision abstract method realized using the present invention, user can be Different level observed data, can capture overall structure change, and the minutia of data can be probed into again, and help excavates one A little hiding structural informations.
Brief description of the drawings
Fig. 1 is flow chart of the invention
Specific embodiment
Technical scheme is altogether in three steps:The first step, using improved power guiding algorithm, generation one has Substantially cluster structure, the preliminary placement of graph structure information can be embodied;Second step, based on layout result, using from bottom to top Hierarchy clustering method generates the hierarchical structure of figure;3rd step, according to the hierarchical structure of generation, carries out vision and takes out in different levels As.
A kind of level vision abstract method based on improvement power derivation graph layout, step is as follows:
1. preliminary placement is generated using improved power guiding algorithm.Improved power guiding algorithm be exactly first with FR algorithms from Beginning is put in seat in the plane, and iterate searching state of minimum energy, produces a relatively stable layout, then perform based on the state LinLog algorithms.
1.1 initialization:Primary condition is set, each node v is assignediOne random site pi
1.2 figures based on FR algorithms are laid out
To each node v in figureiMake following iteration:
What 1.2.1 calculate node was subject to makes a concerted effort:A) first calculate node viWith other nodes vjBetween Euclidean distance x=| pi-pj|.B) substitution formula (1) and (2) calculates the gravitation and repulsion from other nodes suffered by the node respectively.C) according to public affairs Formula (3) calculate node viSuffered F (the v that make a concerted efforti)
f(eij)=x2/k (1)
g(vi, vj)=k2/x (2)
Wherein, k=sqrt (A/ | V |), A are the viewing area area of whole view, and | V | is node total number;eijRepresent section Point viWith vjBetween the side that is connected, therefore formula (1) calculate two have the connected node in side between gravitation.Formula (2) calculates at 2 points Between repulsion.In formula (3)Represent the direction of power.
1.2.2 node location updates:Node viAccording to the effect F (v that make a concerted effort abovei) move, reach new position pi'=pi+C*F(vi).Here C is common constant, is the influence coefficient of power.When C is larger, joints influence is big, motion Faster;Vice versa.
1.2.3 iteration termination condition is judged:The gross energy E of whole system, then calculate node iteration are calculated according to formula (4) Energy differences Δ E before and after location updating, when Δ E is continuously less than the threshold value that certain sets, then it is assumed that system reaches stable state, Stop iteration.
Figure layout under 1.3LinLog algorithms
Based on the layout of FR algorithms, the position of each node is recorded, to each node v in figureiMake following iteration:
What 1.3.1 calculate node was subject to makes a concerted effort:A) first calculate node viWith other nodes vjBetween Euclidean distance x=| pi-pj|.B) substitution formula (5) and (6) calculates the gravitation and repulsion from other nodes suffered by the node respectively.C) according to public affairs Formula (3) calculate node viSuffered F (the v that make a concerted efforti)
f(eij)=C1 (5)
g(vi, vj)=C2/x (6)
C in formula1And C2All it is constant.
1.3.2 node location updates:Node viAccording to the effect F (v that make a concerted effort abovei) move, reach new position pi′。
1.3.3 iteration termination condition is judged:The gross energy E of whole system, then calculate node iteration are calculated according to formula (7) Energy differences Δ E before and after location updating, when Δ E is continuously less than the threshold value that certain sets, then it is assumed that system reaches stable state, Stop iteration.
2. the layout result based on power guiding algorithm, generates the hierarchical structure of figure.
2.1 definition cluster c are five-tuple (lc,rc,wc,fc,Vc), wherein lcAnd rcTwo son clusters of cluster are represented respectively In left subgroup and right subgroup, wcIts weights are represented, as (distance can select different degree to the distance between its sub- cluster Amount), fcIt is his father's cluster, VcThen represent original node set in the figure included in the cluster.
All ancestor node v in 2.2 initialization figuresiFor leaf clusters ci(u,u,0,u,vi), u is expressed as sky here, while The position Pc of initialization leaf clusteriIt is the v after exertin guiding layoutiPosition pi
2.3 calculate the distance between cluster.According to the different abstract needs of network data and vision, can select it is different away from Calculated from measurement.
2.3.1 the Euclidean distance r between cluster is calculatedcicj=| Pci-Pcj| as distance metric.
2.3.2 the average path length l between cluster is calculatedcicjAs distance metric.
2.3.3 according to formula (8) by the average path length l between clustercicjWith the Betweenness Centrality C of clusterB(ci) Sum is combined, used as distance metric.
Wherein α ∈ (0,1) are weighting parameter, represent the shared weight in weights of Betweenness Centrality.α is bigger, then intermediary Influence of the centrality to weights is bigger.ΩijIt is node viAnd vjBetween shortest path bar number, Ωij(vk) it is section in these paths Point vkThe number of times of appearance, therefore, CB(vk) represent node vkBetweenness Centrality.Cluster ckBetweenness Centrality CB(ck) poly- for this The average value of the node Betweenness Centrality that class is included.
2.4 select two cluster ciWith cjApart from dijRecently, the new cluster c of generation is merged as left and right subgroupk (ci,cj,dij,u,(Vci∪Vcj)), position PckThen according to the node set Vc that new cluster is includedkThe mean place of interior joint To determine.Meanwhile, newly cluster ckAs ciWith cjFather cluster, ciWith cj(u, u, 0, c are updated to respectivelyk,Vci) and (u, u, 0, ck,Vcj), and by ckAdd and calculate.
2.5 repeat step 2.3 and 2.4 always, find closest cluster and merge repeatedly, until all clusters all Untill merging into a cluster.
3. it is abstract vision to be carried out in different levels.
3.1 will finally merge the cluster c for obtaining when building hierarchical structurerootIt is defined as root cluster;
3.2 define abstract level parameter AL ∈ [0,1], with AL × wcrootHierarchical structure is intercepted to spend, only will symbol Conjunction condition wck≤AL×wcroot<wfcCluster be shown on view, complete it is abstract to the vision of network structure.By abstract Level AL's changes to obtain different abstract results.
Example application below, the present invention will be described.In this example embodiment, apply the present invention to data in literature, represent Cooperative relationship and pattern between author, step are as follows:
1st, every author of article is regarded into a node, and assigns unique ID viIt is identified;Complete a same piece There is cooperative relationship between the author of article, regard this cooperative relationship as a line, and assign unique ID eijEnter rower Know, represent author viWith author vjBetween have cooperation.Similarly, the author of same piece article is connected with side between any two.Will be all Data in literature is switched to network structure by article after being processed as above.
2nd, the preliminary placement of literature author's cooperative relationship is generated using improved power guiding algorithm.Improved power guiding algorithm It is exactly that iterate searching state of minimum energy first with FR algorithms since random site, produces a relatively stable layout, LinLog algorithms are performed based on the state again.Distance is nearer between the layout interior joint of generation, represents conjunction between corresponding author Make relation closer.
2.1 initialization:It is that every author assigns random initial position p in visual two dimensional surface regioni(x,y)
2.2 figures based on FR algorithms are laid out
To every author v in articleiMake following iteration:
What 2.2.1 calculating author was subject to makes a concerted effort:A) author v is first calculatediWith other author vjBetween Euclidean distance x=| pi-pj|.B) substitution formula (1) and (2) calculates the gravitation and repulsion from other authors suffered by the author respectively.C) according to public affairs Formula (3) calculates author viSuffered F (the v that make a concerted efforti)
f(eij)=x2/k (1)
g(vi, vj)=k2/x (2)
Wherein, k=sqrt (A/ | V |), A are the viewing area area of whole view, and | V | is author's sum;eijRepresent and make Person viWith vjBetween have a cooperative relationship, therefore formula (1) calculates two gravitation having between the author of cooperative relationship.Formula (2) is calculated Repulsion between two authors.In formula (3)Represent the direction of power.
2.2.2 author's location updating:Author viAccording to the effect F (v that make a concerted effort abovei) move, reach new position pi'=pi+C*F(vi).Here C is common constant, is the influence coefficient of power.When C is larger, author's stressing influence is big, motion Faster;Vice versa.
2.2.3 iteration termination condition is judged:The gross energy E of whole system is calculated according to formula (4), then calculates author's iteration Energy differences Δ E before and after location updating, when Δ E is continuously less than the threshold value that certain sets, then it is assumed that system reaches stable state, Stop iteration.
Figure layout under 2.3LinLog algorithms
Based on the layout of FR algorithms, the position of each author is recorded, to each author viMake following iteration:
What 2.3.1 calculating author was subject to makes a concerted effort:A) author v is first calculatediWith other author vjBetween Euclidean distance x=| pi-pj|.B) substitution formula (5) and (6) calculates the gravitation and repulsion from other authors suffered by the author respectively.C) according to public affairs Formula (3) calculates author viSuffered F (the v that make a concerted efforti)
f(eij)=C1 (5)
g(vi, vj)=C2/x (6)
C in formula1And C2All it is constant.
2.3.2 author's location updating:Author viAccording to the effect F (v that make a concerted effort abovei) move, reach new position pi′。
2.3.3 iteration termination condition is judged:The gross energy E of whole system is calculated according to formula (7), then calculates author's iteration Energy differences Δ E before and after location updating, when Δ E is continuously less than the threshold value that certain sets, then it is assumed that system reaches stable state, Stop iteration.
3rd, the result based on power guiding algorithm layout, generates the hierarchical structure of literature author's cooperative relationship.
3.1 define consortium c for five-tuple (lc,rc,wc,fc,Vc), wherein lcAnd rcTwo sons of difference representative organization Left group and right group in group, wcRepresent its weights, the as distance between its sub- group, fcIt is his father group, VcThen table Show the author set included in the group.
3.2 regard all authors as one by one group, initialize all author viIt is initial group ci(u,u,0,u, vi), an author is only included in each group in an initial condition.Here u is expressed as sky, while initializing the position of initial group Put PciIt is the v after exertin guiding layoutiPosition pi
3.3 calculate the distance between group.In calculating average shortest path length two-by-two between author and every intermediary of author Disposition, according to formula (8) using the average path length between group and Betweenness Centrality sum as distance metric.
Wherein α ∈ (0,1) are weighting parameter, represent the shared weight in weights of Betweenness Centrality.α is bigger, then intermediary Influence of the centrality to weights is bigger.ΩijIt is author viAnd vjBetween shortest path bar number, Ωij(vk) it is work in these paths Person vkThe number of times of appearance, therefore, CB(vk) represent author vkBetweenness Centrality.Group ckBetweenness Centrality CB(ck) it is the group The average value of author's Betweenness Centrality that body is included.
3.4 select Liang Ge groups c in all entitiesiWith cjApart from dijRecently, closed as left and right group And produce new consortium ck(ci,cj,dij,u,(Vci∪Vcj)), position PckThe author's set Vc for then being included according to new attributek The mean place of middle author determines.Meanwhile, new consortium ckAs ciWith cjFather group, ciWith cjBe updated to respectively (u, u,0,ck,Vci) and (u, u, 0, ck,Vcj), and by new attribute ckAdd and calculate.
3.5 repeat step 3.3 and 3.4 always, find closest group and merge repeatedly, until by all of work Untill person group merges into a group.
4th, to carry out vision in different levels abstract.Abstract level parameter is adjusted, shows that the author of different abstract levels closes Make relational structure.
4.1 will finally merge the consortium c for obtaining when building hierarchical structurerootIt is defined as total group
4.2 define abstract level parameter AL ∈ [0,1], with AL × wcrootHierarchical structure is intercepted to spend, only will symbol Conjunction condition wck≤AL×wcroot<wfcConsortium be shown on view, complete to the vision of literature author's cooperative relationship structure It is abstract.Different abstract results are obtained by the change of abstract level AL.When abstract level is 0, it is shown that power guiding cloth Office's result, as abstract level increases, cooperates close author and gradually merges into consortium, while during some have an intermediary high The author of disposition is retained.Represent the modality for co-operation of literature author by abstract view, such as individually creation, groupuscule are closed Work, on a large scale across group cooperation etc..

Claims (1)

1. a kind of based on the level vision abstract method for improving power derivation graph layout, step is as follows:
Step 1. generates preliminary placement using improved power guiding algorithm;Improved power guiding algorithm be exactly first with FR algorithms from Beginning is put in seat in the plane, and iterate searching state of minimum energy, produces a relatively stable layout, then perform based on the state LinLog algorithms;
1.1 initialization:Primary condition is set, each node v is assignediOne random site pi
1.2 figures based on FR algorithms are laid out
To each node v in figureiMake following iteration:
What 1.2.1 calculate node was subject to makes a concerted effort:A) first calculate node viWith other nodes vjBetween Euclidean distance x=| pi-pj |;B) substitution formula (1) and (2) calculates the gravitation and repulsion from other nodes suffered by the node respectively;C) according to formula (3) calculate node viSuffered F (the v that make a concerted efforti)
f(eij)=x2/k (1)
g(vi,vj)=k2/x (2)
F ( v i ) = &Sigma; e i j f ( e i j ) x &OverBar; - &Sigma; i &NotEqual; j g ( v i , v j ) x &OverBar; - - - ( 3 )
Wherein, k=sqrt (A/ | V |), A are the viewing area area of whole view, and | V | is node total number;eijRepresent node vi With vjBetween the side that is connected, therefore formula (1) calculate two have the connected node in side between gravitation;Formula (2) calculates point-to-point transmission Repulsion;In formula (3)Represent the direction of power;
1.2.2 node location updates:Node viAccording to the effect F (v that make a concerted effort abovei) move, reach new position pi′ =pi+C*F(vi);Here C is common constant, is the influence coefficient of power;When C is larger, joints influence is big, motion compared with Quickly;Vice versa;
1.2.3 iteration termination condition is judged:The gross energy E of whole system, then calculate node iteration position are calculated according to formula (4) The energy differences Δ E before and after updating is put, when Δ E is continuously less than the threshold value that certain sets, then it is assumed that system reaches stable state, stops Only iteration;
E = &Sigma; e i j | p i - p j | 3 - &Sigma; i &NotEqual; j ln | p i - p j | - - - ( 4 )
Figure layout under 1.3 LinLog algorithms
Based on the layout of FR algorithms, the position of each node is recorded, to each node v in figureiMake following iteration:
What 1.3.1 calculate node was subject to makes a concerted effort:A) first calculate node viWith other nodes vjBetween Euclidean distance x=| pi-pj |;B) substitution formula (5) and (6) calculates the gravitation and repulsion from other nodes suffered by the node respectively;C) according to formula (3) calculate node viSuffered F (the v that make a concerted efforti)
f(eij)=C1 (5)
g(vi,vj)=C2/x (6)
C in formula1And C2All it is constant;
1.3.2 node location updates:Node viAccording to the effect F (v that make a concerted effort abovei) move, reach new position pi′;
1.3.3 iteration termination condition is judged:The gross energy E of whole system, then calculate node iteration position are calculated according to formula (7) The energy differences Δ E before and after updating is put, when Δ E is continuously less than the threshold value that certain sets, then it is assumed that system reaches stable state, stops Only iteration;
E = &Sigma; e i j | p i - p j | - &Sigma; i &NotEqual; j ln | p i - p j | - - - ( 7 )
Step 2. is based on the layout result of power guiding algorithm, generates the hierarchical structure of figure;
2.1 definition cluster c are five-tuple (lc,rc,wc,fc,Vc), wherein lcAnd rcIn representing two of cluster son clusters respectively Left subgroup and right subgroup, wcRepresent its weights, the distance (distance can select different measurements) as between its sub- cluster, fc It is his father's cluster, VcThen represent original node set in the figure included in the cluster;
All ancestor node v in 2.2 initialization figuresiFor leaf clusters ci(u,u,0,u,vi), u is expressed as sky here, while just The position Pc of beginningization leaf clusteriIt is the v after exertin guiding layoutiPosition pi
2.3 calculate the distance between cluster;According to the different abstract needs of network data and vision, different distances can be selected Measurement is calculated;
2.3.1 the Euclidean distance r between cluster is calculatedcicj=| Pci-Pcj| as distance metric;
2.3.2 the average path length l between cluster is calculatedcicjAs distance metric;
2.3.3 according to formula (8) by the average path length l between clustercicjWith the Betweenness Centrality C of clusterB(ci) it Be combined, as distance metric;
w c k = &alpha; &times; ( C B ( c i ) + C B ( c j ) ) + ( 1 - &alpha; ) &times; l c i c j - - - ( 8 )
C B ( c k ) = 1 | Vc k | * &Sigma; v k &Element; Vc k C B ( v k ) - - - ( 9 )
C B ( v k ) = &Sigma; i &NotEqual; j &NotEqual; k &Omega; i j ( v k ) &Omega; i j - - - ( 10 )
Wherein α ∈ (0,1) are weighting parameter, represent the shared weight in weights of Betweenness Centrality;α is bigger, then intermediary center Influence of the property to weights is bigger;ΩijIt is node viAnd vjBetween shortest path bar number, Ωij(vk) it is these paths interior joints vkGo out Existing number of times, therefore, CB(vk) represent node vkBetweenness Centrality;Cluster ckBetweenness Centrality CB(ck) wrapped by the cluster The average value of the node Betweenness Centrality for containing;
2.4 select two cluster ciWith cjApart from dijRecently, the new cluster c of generation is merged as left and right subgroupk (ci,cj,dij,u,(Vci∪Vcj)), position PckThen according to the node set Vc that new cluster is includedkThe mean place of interior joint To determine;Meanwhile, newly cluster ckAs ciWith cjFather cluster, ciWith cj(u, u, 0, c are updated to respectivelyk,Vci) and (u, u, 0, ck,Vcj), and by ckAdd and calculate;
2.5 repeat step 2.3 and 2.4 always, find closest cluster and merge repeatedly, until all clusters are all closed And untill being clustered for one;
It is abstract that step 3. carries out vision in different levels;
3.1 will finally merge the cluster c for obtaining when building hierarchical structurerootIt is defined as root cluster
3.2 define abstract level parameter AL ∈ [0,1], with AL × wcrootHierarchical structure is intercepted to spend, only will meet bar Part wck≤AL×wcroot<wfcCluster be shown on view, complete it is abstract to the vision of network structure;By abstract level AL's changes to obtain different abstract results.
CN201710157017.1A 2017-03-16 2017-03-16 Based on the level vision abstract method for improving power derivation graph layout Active CN106934422B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710157017.1A CN106934422B (en) 2017-03-16 2017-03-16 Based on the level vision abstract method for improving power derivation graph layout

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710157017.1A CN106934422B (en) 2017-03-16 2017-03-16 Based on the level vision abstract method for improving power derivation graph layout

Publications (2)

Publication Number Publication Date
CN106934422A true CN106934422A (en) 2017-07-07
CN106934422B CN106934422B (en) 2019-07-26

Family

ID=59432425

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710157017.1A Active CN106934422B (en) 2017-03-16 2017-03-16 Based on the level vision abstract method for improving power derivation graph layout

Country Status (1)

Country Link
CN (1) CN106934422B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107623594A (en) * 2017-09-01 2018-01-23 电子科技大学 A kind of three-dimensional level network topology method for visualizing of geographical location information constraint
CN107818149A (en) * 2017-10-23 2018-03-20 中国科学院信息工程研究所 A kind of diagram data visual layout optimization method based on power guiding algorithm
CN109245921A (en) * 2018-08-24 2019-01-18 电子科技大学 A kind of network topology structure method for visualizing in irregular area
CN111061921A (en) * 2019-12-04 2020-04-24 智器云南京信息科技有限公司 Image layout implementation method, system, terminal equipment and storage medium
CN113867850A (en) * 2020-06-29 2021-12-31 阿里巴巴集团控股有限公司 Data processing method, device, equipment and storage medium
CN116186953A (en) * 2023-04-26 2023-05-30 中国电建集团昆明勘测设计研究院有限公司 Layout method, device and equipment of leveling directed graph and storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103064837A (en) * 2011-10-19 2013-04-24 西安邮电学院 Retrieval of leading figures in academic fields and visualized navigation system
CN103065028A (en) * 2011-10-19 2013-04-24 西安邮电学院 Visualization layout method based on image multi-stage task system modular decomposition
CN104090957A (en) * 2014-03-10 2014-10-08 中国科学院软件研究所 Heterogeneous network interactive visualization method
CN104217073A (en) * 2014-08-26 2014-12-17 重庆邮电大学 Network association gravitation-directed visualization layout method
CN105260611A (en) * 2015-10-26 2016-01-20 浙江工业大学 Map layout method based on node attribute transfer functions
CN106484754A (en) * 2016-07-28 2017-03-08 西安交通大学 Based on hierarchical data and the knowledge forest layout method of diagram data visualization technique

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103064837A (en) * 2011-10-19 2013-04-24 西安邮电学院 Retrieval of leading figures in academic fields and visualized navigation system
CN103065028A (en) * 2011-10-19 2013-04-24 西安邮电学院 Visualization layout method based on image multi-stage task system modular decomposition
CN104090957A (en) * 2014-03-10 2014-10-08 中国科学院软件研究所 Heterogeneous network interactive visualization method
CN104217073A (en) * 2014-08-26 2014-12-17 重庆邮电大学 Network association gravitation-directed visualization layout method
CN105260611A (en) * 2015-10-26 2016-01-20 浙江工业大学 Map layout method based on node attribute transfer functions
CN106484754A (en) * 2016-07-28 2017-03-08 西安交通大学 Based on hierarchical data and the knowledge forest layout method of diagram data visualization technique

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ANDREAS NOACK: "an energy model for visual graph clustering", 《INTERNATIONAL SYMPOSIUM ON GRAPH DRAWING GD 2003:GRAPH DRAWING》 *
THOMAS M.J.FRUCHTERMAN等: "graph grawing by force-directed placement", 《SOFTWARE-PRACTICE AND EXPERICENCE》 *

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107623594A (en) * 2017-09-01 2018-01-23 电子科技大学 A kind of three-dimensional level network topology method for visualizing of geographical location information constraint
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
CN109245921A (en) * 2018-08-24 2019-01-18 电子科技大学 A kind of network topology structure method for visualizing in irregular area
CN111061921A (en) * 2019-12-04 2020-04-24 智器云南京信息科技有限公司 Image layout implementation method, system, terminal equipment and storage medium
CN111061921B (en) * 2019-12-04 2020-10-30 智器云南京信息科技有限公司 Image layout implementation method, system, terminal equipment and storage medium
CN113867850A (en) * 2020-06-29 2021-12-31 阿里巴巴集团控股有限公司 Data processing method, device, equipment and storage medium
CN113867850B (en) * 2020-06-29 2023-12-29 阿里巴巴集团控股有限公司 Data processing method, device, equipment and storage medium
CN116186953A (en) * 2023-04-26 2023-05-30 中国电建集团昆明勘测设计研究院有限公司 Layout method, device and equipment of leveling directed graph and storage medium
CN116186953B (en) * 2023-04-26 2023-07-07 中国电建集团昆明勘测设计研究院有限公司 Layout method, device and equipment of leveling directed graph and storage medium

Also Published As

Publication number Publication date
CN106934422B (en) 2019-07-26

Similar Documents

Publication Publication Date Title
CN106934422A (en) Based on the level vision abstract method for improving power derivation graph layout
CN103106279B (en) Clustering method a kind of while based on nodal community and structural relationship similarity
US8605092B2 (en) Method and apparatus of animation planning for a dynamic graph
Shavitt et al. Big-bang simulation for embedding network distances in euclidean space
CN105354873B (en) For the pattern density function analogy method of porous media three-dimensionalreconstruction
Hu et al. An interactive co-evolutionary CAD system for garment pattern design
CN103699678B (en) A kind of hierarchy clustering method based on multistage stratified sampling and system
CN106484754A (en) Based on hierarchical data and the knowledge forest layout method of diagram data visualization technique
CN109960755B (en) User privacy protection method based on dynamic iteration fast gradient
CN109471995A (en) A kind of hyperbolic embedding grammar of complex network
CN104680238A (en) To-be-observed task determination method for multi-satellite synergistic earth observation
CN105959132A (en) Community layout visualization method facing large scale network
CN100454341C (en) Process type ground fast drawing method based on fractal hierarchical tree
CN105591876B (en) A kind of mapping method of virtual network
Guo et al. Real‐time meshless deformation
CN104036013B (en) The formal notion computational methods of blog data based on attribute topology
CN106055694B (en) A kind of geographical line tortuosity measure based on comentropy
CN109064558A (en) A kind of uncertain planning geological surface reconstructing method based on feature
CN104123655A (en) Simulation fitting system
Huang et al. A space efficient clustered visualization of large graphs
CN115984595A (en) Multivariate graph clustering method based on Laplace rank constraint
CN109376217A (en) Based on the architecture of value, the node set of typing frequency nominal data map and its topological structure determine method entirely
Carlson Dirichlet to Neumann maps for infinite quantum graphs
Wang et al. On 3D model construction by fusing heterogeneous sensor data
CN114092666A (en) Model mesh simplification improvement algorithm for mobile AR auxiliary building construction APP

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