Triangles as basis to detect communities: an application to Twitter's network

Abstract

Nowadays, the interest given by the scientific community to the investigation of the data generated by social networks is increasing as much as the exponential increasing of social network data. The data structure complexity is one among the snags, which slowdown their understanding. On the other hand, community detection in social networks helps the analyzers to reveal the structure and the underlying semantic within communities. In this paper we propose an interactive visualization approach relying on our application NLCOMS, which uses synchronous and related views for graph and community visualization. Additionally, we present our algorithm for community detection in networks. A computation study is conducted on instances generated with the LFR [9]-[10] benchmark. Finally, in order to assess our approach on real-world data, we consider the data of the ANR-Info-RSN project. The latter addresses community detection in Twitter.

arXiv comment19 pages, 18 figures

References in corpus (12)

• Fast unfolding of communities in large networks
• Finding and evaluating community structure in networks
• Modularity and community structure in networks
• Finding community structure in very large networks
• Natural Scales in Geographical Patterns
• Benchmark graphs for testing community detection algorithms
• Analysis of weighted networks
• Community detection algorithms: a comparative analysis
• Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
• Empirical Comparison of Algorithms for Network Community Detection
• Using Triangles to Improve Community Detection in Directed Networks
• Triangles to Capture Social Cohesion