2020
DOI: 10.1007/s11042-020-08700-4
|View full text |Cite
|
Sign up to set email alerts
|

Visual analysis for evaluation of community detection algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0
1

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 23 publications
(16 citation statements)
references
References 37 publications
0
15
0
1
Order By: Relevance
“…The computation of a modularity score of 0.312 supports the interpretation that community structures in the network were not very strong. The modularity score ranges between −1 and 1 with higher modularity scores indicating stronger community structures [52]. The graphical layout by the Fruchterman-Reingold algorithm also supports this interpretation since many actors of the different communities were placed close to each other and communities partially overlap in the centre of the graph.…”
Section: Actor Coalitions In the Policy Debatementioning
confidence: 62%
See 1 more Smart Citation
“…The computation of a modularity score of 0.312 supports the interpretation that community structures in the network were not very strong. The modularity score ranges between −1 and 1 with higher modularity scores indicating stronger community structures [52]. The graphical layout by the Fruchterman-Reingold algorithm also supports this interpretation since many actors of the different communities were placed close to each other and communities partially overlap in the centre of the graph.…”
Section: Actor Coalitions In the Policy Debatementioning
confidence: 62%
“…The method identifies communities within networks based on a modularity measure and a hierarchical approach [9]. Modularity measures the strength of community structures compared to a random network with identical sets of nodes and edges [52]. Communities are more similar subsets of nodes and may, therefore, represent actor coalitions as their similarity is determined based on their shared policy beliefs.…”
Section: Which Coalition Structures Make Policy Change More Likely?mentioning
confidence: 99%
“…Network community detection can be seen as a clustering task, highly used in data mining scenarios, but applied to complex networks (Guidotti and Coscia, 2017). In this way, traditional clustering methods, such as DBSCAN (Ester et al, 1996), can be adapted to the community detection task (Gialampoukidis et al, 2016;Linhares et al, 2020). Among the existent community detection algorithms, Louvain (Blondel et al, 2008) and Infomap (Rosvall and Bergstrom, 2008) represent two of the most recommended approaches due to their performances and low computational complexity (Fortunato and Hric, 2016).…”
Section: Temporal Network Visualisationmentioning
confidence: 99%
“…Considering that the best node reordering algorithm according to the quantitative analysis may not represent the best visual user experience, we also performed a visual analysis. Figure 34 shows two days of the Hospital network using different node reordering strategies: 1Appearance; (2) RN ; (3) CNO (Infomap, RN, RN); (4) CNO (Louvain, RN, RN); (5) CNO (Infomap, RN, RN) Intra; (6) CNO (Louvain, RN, RN) Intra. The Appearance layout has the most visual clutter amongst all strategies.…”
Section: Small Dataset -Hospitalmentioning
confidence: 99%
“…The published book chapter [4] contains the visualization of dynamic processes, detailed in Chapter 5. In [5] we present a visualization method that allows the analysis of two community detection algorithms in four different networks, detailed in Chapter 3.…”
Section: Bibliographical Publicationsmentioning
confidence: 99%