Papers
Topics
Authors
Recent
2000 character limit reached

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

Published 16 Jun 2016 in cs.SI and physics.soc-ph | (1606.05136v2)

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.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.