2017 36th Chinese Control Conference (CCC) 2017
DOI: 10.23919/chicc.2017.8029133
|View full text |Cite
|
Sign up to set email alerts
|

Establishing the community structure of signed interconnected graph in data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…As declared above, it is natural to use the similarity matrix, calculated from Pearson correlation coefficient of all pairs of dWFC’s, as the adjacent matrix in community clustering. In this study, the adjacent matrix A is a signed weighted matrix, and we employ an approach based on an extended signed Q-modularity of the graph (Lu et al, 2017). The graph is divided into two graphs composed by positive edges and negative edges, respectively, represent by A + and A − , where Ai,j+ ≥ 0 and Ai,j- ≤ 0.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…As declared above, it is natural to use the similarity matrix, calculated from Pearson correlation coefficient of all pairs of dWFC’s, as the adjacent matrix in community clustering. In this study, the adjacent matrix A is a signed weighted matrix, and we employ an approach based on an extended signed Q-modularity of the graph (Lu et al, 2017). The graph is divided into two graphs composed by positive edges and negative edges, respectively, represent by A + and A − , where Ai,j+ ≥ 0 and Ai,j- ≤ 0.…”
Section: Methodsmentioning
confidence: 99%
“…The graph is divided into two graphs composed by positive edges and negative edges, respectively, represent by A + and A − , where Ai,j+ ≥ 0 and Ai,j- ≤ 0. The extended signed Q-modularity equals (Lu et al, 2017): (i) the fraction of edge weights, of which both head and tail nodes fall within the same community, minus (ii) the expected value of the edge weights of a random graph that follows the same positive weight degree distribution of the intrinsic graph, plus (iii) the expected value of the edge weights of a random graph that follows the same negative weight degree distribution of this intrinsic graph. This can be formulated as…”
Section: Methodsmentioning
confidence: 99%