Triangles as basis to detect communities: an application to Twitter's network
Preprint
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.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Branch-and-bound algorithm for the maximum triangle packing problemComputers & Industrial Engineering, 2015
- A Fast Agglomerative Community Detection Method for Protein Complex Discovery in Protein Interaction Networks2013
- Community detection algorithms: A comparative analysisPhysical Review E, 2009
- Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communitiesPhysical Review E, 2009
- An improved randomized approximation algorithm for maximum triangle packingDiscrete Applied Mathematics, 2009
- Benchmark graphs for testing community detection algorithmsPhysical Review E, 2008
- Fast unfolding of communities in large networksJournal of Statistical Mechanics: Theory and Experiment, 2008
- Finding community structure in very large networksPhysical Review E, 2004
- Analysis of weighted networksPhysical Review E, 2004
- Finding and evaluating community structure in networksPhysical Review E, 2004