Communities in graphs and hypergraphs

Authors:
Michael Brinkmeier;Jeremias Werner;Sven Recknagel
Affiliations:
Technische Universität Ilmenau, Ilmenau, Germany;Technische Universität Ilmenau, Ilmenau, Germany;Technische Universität Ilmenau, Ilmenau, Germany
Venue:
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Year:
2007

Citing 7
Cited 3

Identifying aggregates in hypertext structures

HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
Cluster analysis for hypertext systems

SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
A simple min-cut algorithm

Journal of the ACM (JACM)
Efficient identification of Web communities

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Self-Organization and Identification of Web Communities

Computer
A simple and fast min-cut algorithm

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Subdivision Drawings of Hypergraphs

Graph Drawing
On planar supports for hypergraphs

GD'09 Proceedings of the 17th international conference on Graph Drawing
Detecting overlapping communities in folksonomies

Proceedings of the 23rd ACM conference on Hypertext and social media

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we define a type of cohesive subgroups - called communities - in hypergraphs, based on the edge connectivity of subhypergraphs. We describe a simple algorithm for the construction of these sets and show, based on examples from image segmentation and information retrieval, that these groups may be useful for the analysis and accessibility of large graphs and hypergraphs.