• No results found

Visualization of Hierarchical Communities in Large Scale Complex Networks

N/A
N/A
Protected

Academic year: 2021

Share "Visualization of Hierarchical Communities in Large Scale Complex Networks"

Copied!
2
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Visualization of Hierarchical Communities in Large

Scale Complex Networks

Real-world large scale complex networks exhibit community structures.

Nodes with similar connections tend to be part of one community with more

edges within the community than the edges to other communities. In

litera-ture several community detection techniques have been proposed, including

the Louvain method [1], OSLOM [2] and AH-KSC [3, 4]. These techniques

provide hierarchical community information for large scale networks.

How-ever, there is no visualization tool which allows to illustrate the hierarchical

communities at different levels of granularity.

Figure 1: Flat clustering visualization, i.e. only one level of hierarchy, related

to my facebook graph.

(2)

OSLOM [2] allows visualization of 2 layers of hierarchy at a given time

using the software Gephi [5]. The goal of this master thesis is to build an

online tool which behaves similar to Google Maps i.e. by means of a scroll

bar we can zoom in and zoom out at the layers of hierarchy and displays

appropriate communities in the large scale networks. The challenge lies in

the design of the user interface and displaying communities, which merge

at higher level of hierarchy, close to each other at lower levels. We plan to

experiment on visualization of different large scale networks available at [6].

• Requirements: Basic knowledge of Networks and R . • Tool to Learn: Shiny [7].

• Type of work: Literature: 25%, Implementation: 50%, Experiments and Results: 25%

• Research Unit: STADIUS-ESAT

• Daily advisers: Raghvendra Mall and Rocco Langone

• e.mail: raghvendra.mall@esat.kuleuven.be and rocco.langone@esat.kuleuven.be • Promoter: Prof. Johan Suykens

• Number of students: 1.

• Suitable Master: WIT (mathematical engineering), AI (artificial intelligence).

References

[1] V. Blondel, J. Guillaume, R. Lambiotte and L. Lefebvre, Fast unfolding of commu-nities in large networks., Journal of Statistical Mechanics: Theory and Experiment, 10:P10008, 2008.

[2] A. Lanchichinetti, F. Radicchi, J. Ramasco, and S. Fortunato, Finding statistically significant communities in networks, PLOS ONE, 6(e18961), 2011.

[3] R. Mall, R. Langone and J. A. K. Suykens, Agglomerative Hierarchical Kernel Spectral Clustering for Large Scale Networks, In Proc. of European Symposium on Artificial Neural Networks (ESANN), Brugges, Belgium, April, 2014.

[4] R. Mall, R. Langone and J. A. K. Suykens, Multilevel Hierarchical Kernel Spectral Clustering for Real-Life Large Scale Complex Networks, PLOS One, e99966, 9(6), pp. 1-18, 2014.

[5] http://gephi.github.io/

[6] https://snap.stanford.edu/data/ [7] http://shiny.rstudio.com/

Referenties

GERELATEERDE DOCUMENTEN

2014 Agglomerative Hierarchical Kernel Spectral Clustering for Large Scale Networks Authors: Raghvendra Mall, Rocco Langone and Johan A.K.

Mall R., Langone R., Suykens J.A.K., ”Multilevel Hierarchical Kernel Spectral Clustering for Real-Life Large Scale Complex Networks”, PLOS One, e99966, vol. Mall R., Suykens

In order to estimate these peaks and obtain a hierarchical organization for the given dataset we exploit the structure of the eigen-projections for the validation set obtained from

Multilevel Hierarchical Kernel Spectral Clustering for Real-Life Large Scale Complex Networks.. Raghvendra Mall, Rocco Langone and

Overlapping causes non-zero similarities for points in different clusters leading to approximately piecewise constant eigenvectors.. Figure 5 shows the model selection plots and

We used the normalized linear kernel for large scale networks and devised an approach to automatically identify the number of clusters k in the given network. For achieving this,

In order to estimate these peaks and obtain a hierarchical organization for the given dataset we exploit the structure of the eigen-projections for the validation set obtained from

So in our experiments, we evaluate the proposed multilevel hierarchical kernel spectral clustering (MH-KSC) algorithm against the Louvain, Infomap and OSLOM methods.. These