Author: Neubauer Nicolas Obermayer Klaus
Publisher: Taylor & Francis Ltd
ISSN: 1361-4568
Source: New Review in Hypermedia and Multimedia, Vol.17, Iss.3, 2011-12, pp. : 267-294
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Community detection is a branch of network analysis concerned with identifying strongly connected subnetworks. Social bookmarking sites aggregate datasets of often hundreds of millions of triples (document, user, and tag), which, when interpreted as edges of a graph, give rise to special networks called 3-partite, 3-uniform hypergraphs. We identify challenges and opportunities of generalizing community detection and in particular modularity optimization to these structures. Two methods for community detection are introduced that preserve the hypergraph's special structure to different degrees. Their performance is compared on synthetic datasets, showing the benefits of structure preservation. Furthermore, a tool for interactive exploration of the community detection results is introduced and applied to examples from real datasets. We find additional evidence for the importance of structure preservation and, more generally, demonstrate how tripartite community detection can help understand the structure of social bookmarking data.
Related content
Community structure discovery in Facebook
International Journal of Social Network Mining, Vol. 1, Iss. 1, 2012-01 ,pp. :