|
Title:
|
A NOVEL ALGORITHM FOR SCALING DOWN LARGE SOCIAL NETWORKS |
|
Author(s):
|
Delel Rhouma and Lotfi Ben Romdhane |
|
ISBN:
|
978-989-8533-69-2 |
|
Editors:
|
Pedro Isaías and Hans Weghorn |
|
Year:
|
2017 |
|
Edition:
|
Single |
|
Keywords:
|
Graph, Social Networks, Coarsening, Multi-level |
|
Type:
|
Full Paper |
|
First Page:
|
187 |
|
Last Page:
|
194 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
The outburst of social networks has engendered big data that cant be easily consumed by analyzers. In fact, helping to understand the information content of these huge graphs becomes a fundamental challenge. For that, several techniques have been developed in order to extract a small meaningful representation. Graph coarsening is one of them and its main benefit is to save key characteristics of networks. This paper sets out a multilevel graph coarsening scheme for the management of a community discovering problem. The principal procedure of our algorithm named MMCA (Multi-level Merging Compact Areas) is to merge well connected zones in every level until a stopping criterion is met. Our experimentations on real social networks show the efficiency of our model. |
|
|
|
|
|
|
