Detecting communities in K-partite K-uniform (hyper)networks

DOI10.1007/S11390-011-0177-0zbMATH Open1280.68055arXiv1011.1043OpenAlexW1527470812MaRDI QIDQ2434548FDOQ2434548

Authors: Xin Liu, Tsuyoshi Murata 

Publication date: 6 February 2014

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Abstract: In social tagging systems, also known as folksonomies, users collaboratively manage tags to annotate resources. Naturally, social tagging systems can be modeled as a tripartite hypergraph, where there are three different types of nodes, namely users, resources and tags, and each hyperedge has three end nodes, connecting a user, a resource and a tag that the user employs to annotate the resource. Then, how can we automatically detect user, resource and tag communities from the tripartite hypergraph? In this paper, by turning the problem into a problem of finding an efficient compression of the hypergraph's structure, we propose a quality function for measuring the goodness of partitions of a tripartite hypergraph into communities. Later, we develop a fast community detection algorithm based on minimizing the quality function. We explain advantages of our method and validate it by comparing with various state of the art techniques in a set of synthetic datasets.

Full work available at URL: https://arxiv.org/abs/1011.1043

Recommendations

• Community detection in hypernetwork via density-ordered tree partition
• Modularity based community detection in heterogeneous networks
• Community detection for networks with unipartite and bipartite structure
• Searching for communities in bipartite networks
• EMERGENT COMMUNITY STRUCTURE IN SOCIAL TAGGING SYSTEMS

zbMATH Keywords

clusteringcommunity detectionbipartite graphtripartite hypergraphsocial tagging

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Network design and communication in computer systems (68M10)

Cites Work

• A generalized maximum entropy approach to Bregman co-clustering and matrix approximation
• An Efficient Heuristic Procedure for Partitioning Graphs
• Networks. An introduction.
• Modeling by shortest data description
• A new modularity for detecting one-to-many correspondence of communities in bipartite networks

Cited In (2)

• Flow-Based Community Detection in Hypergraphs
• Community detection in hypernetwork via density-ordered tree partition

This page was built for publication: Detecting communities in \(K\)-partite \(K\)-uniform (hyper)networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434548)