Anzeige
Erschienen in:
01.09.2015 | S.I. : ICACNI 2014
Spanning tree-based fast community detection methods in social networks
Erschienen in: Innovations in Systems and Software Engineering | Ausgabe 3/2015
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
In this paper, we address the problem of community detection in social networks. We present two maximum cost spanning tree-based community detection methods, namely P-SPAT and K-SPAT, for social networks. Communities are defined as dense subgraphs present in social networks. However, detecting communities in a social network can still be a challenging task, in terms of computational overheads and accuracy of the detected communities. Therefore, finding communities from a social network is considered to be an interesting problem. Again, due to practical applications of community detection techniques, it is a key area of research in social network analysis and is also well studied. Experimental results show that these methods can detect highly accurate communities faster than the state-of-the-art community detection techniques.