Detecting Communities in Tripartite Hypergraphs

Details Detecting Communities in Tripartite Hypergraphs Detecting Communities in Tripartite Hypergraphs

2010-11-04

arxiv.org/abs/1011.1043v1

Journal of Computer Science and Technology, vol.26, no.5, pp.778-791, Sep 2011

Computer Science

Social and Information Networks

4 pages, 3 figures

Scientific paper

10.1007/s11390-011-0177-0

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.

Affiliated with

Also associated with

No associations

Rating

Detecting Communities in Tripartite Hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Detecting Communities in Tripartite Hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting Communities in Tripartite Hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-145215