poster

Communities in graphs and hypergraphs

Authors:

Michael Brinkmeier,

Jeremias Werner,

Sven RecknagelAuthors Info & Claims

CIKM '07: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management

Pages 869 - 872

https://doi.org/10.1145/1321440.1321563

Published: 06 November 2007 Publication History

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.

References

[1]

R. A. Botafogo. Cluster analysis for hypertext systems. In Proc. of the 16-th Annual ACM SIGIR Conference of Res. and Dev. in Info. Retrieval, pages 116--125, 1993.

Digital Library

[2]

R. A. Botafogo and B. Shneiderman. Identifying aggregates in hypertext structures. In UK Conference on Hypertext, pages 63--74, 1991.

Digital Library

[3]

M. Brinkmeier. Communities in graphs. In T. Böhme, G. Heyer, and H. Unger, editors, IICS, volume 2877 of Lecture Notes in Computer Science, pages 20--35. Springer, 2003.

[4]

M. Brinkmeier. A simple and fast min-cut algorithm. In M. Liskiewicz and R. Reischuk, editors, FCT, volume 3623 of Lecture Notes in Computer Science, pages 317--328. Springer, 2005.

Digital Library

[5]

M. Brinkmeier. Minimizing symmetric set functions faster, 2006. Technical Report, Technical University Ilmenau, Germany, 2006.

[6]

G. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 150--160, Boston, MA, August 20-23 2000.

Digital Library

[7]

G. W. Flake, S. Lawrence, C. L. Giles, and F. Coetzee. Self-organization of the web and identification of communities. IEEE Computer, 35(3):66--71, 2002.

Digital Library

[8]

M. Gaertler. Clustering. In U. Brandes and T. Erlebach, editors, Network Analysis, volume 3418 of Lecture Notes in Computer Science, pages 178--215. Springer, 2004.

[9]

R. E. T. Gary William Flake and K. Tsioutsiouliklis. Graph clustering and minimum cut trees. Internet Mathematics, 1(3):355--378, 2004.

[10]

R. Klimmek and F. Wagner. A simple hypergraph min cut algorithm, 1995.

[11]

F. Luccio and M. Sami. On the decomposition of networks in minimally interconnected subnetworks. IEEE Transactions on Circuit Theory, 16(2):184--188, 1969.

[12]

D. W. Matula. k-components, clusters, and slicings in graphs. SIAM J. Appl. Math., 22(3):459--480, 1972.

[13]

S. B. Seidman. Internal cohesion of ls sets in graphs. Social Networks, 5:97--107, 1983.

[14]

J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888--905, 2000.

Digital Library

[15]

M. Stoer and F. Wagner. A simple min-cut algorithm. Journal of the ACM, 44(4):585--591, July 1997.

Digital Library

[16]

S. Wassermann and K. Faust. Social Networks Analysis: Methods and Applications. Cambridge University Press, 1994.

[17]

J. Werner. Kohesive gruppen in hypergraphen. Diplomarbeit, Technische Universität Ilmenau, Germany, 2007.

Cited By

Arafat NBressan S(2017)Hypergraph Drawing by Force-Directed PlacementDatabase and Expert Systems Applications10.1007/978-3-319-64471-4_31(387-394)Online publication date: 2-Aug-2017
https://doi.org/10.1007/978-3-319-64471-4_31
Zhu FFang YChang KYing J(2015)Scheduled approximation for Personalized PageRank with Utility-based Hub SelectionThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-014-0376-824:5(655-679)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1007/s00778-014-0376-8
Hu JWei XHe H(2014)Brain Image Segmentation Based on Hypergraph ModelingProceedings of the 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing10.1109/DASC.2014.65(327-332)Online publication date: 24-Aug-2014
https://dl.acm.org/doi/10.1109/DASC.2014.65
Show More Cited By

Index Terms

Communities in graphs and hypergraphs
1. Information systems
  1. Information retrieval

Recommendations

Maximally edge-connected hypergraphs

The edge-connectivity of a connected graph or hypergraph is the minimum number of edges whose removal renders the graph or hypergraph, respectively, disconnected. The edge-connectivity of a (hyper) graph cannot exceed its minimum degree. For graphs, ...
Line Graphs of Helly Hypergraphs

A natural generalization of the notion of domino introduced and investigated in [T. Kloks, D. Kratsch, and H. Müller, Dominoes, Lecture Notes in Comput. Sci. 903, Springer-Verlag, Berlin, 1995, pp. 106--120] is considered. A graph is called an r-mino if ...
Covering Non-uniform Hypergraphs

A subset of the vertices in a hypergraph is a cover if it intersects every edge. Let (H) denote the cardinality of a minimum cover in the hypergraph H, and let us denote by g(n) the maximum of (H) taken over all hypergraphs H with n vertices and with no ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '07: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management

November 2007

1048 pages

ISBN:9781595938039

DOI:10.1145/1321440

Co-chair:
Alberto H. F. Laender,
Conference Chairs:
André O. Falcão
Universidade de Lisboa, Portugal
,
Øystein Haug Olsen,
General Chair:
Mário J. Silva
(Universidade de Lisboa, Portugal)
,
Program Chairs:
Ricardo Baeza-Yates,
Deborah L. McGuinness,
Bjorn Olstad

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 November 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

CIKM07

Sponsor:

CIKM07: Conference on Information and Knowledge Management

November 6 - 10, 2007

Lisbon, Portugal

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
465
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Arafat NBressan S(2017)Hypergraph Drawing by Force-Directed PlacementDatabase and Expert Systems Applications10.1007/978-3-319-64471-4_31(387-394)Online publication date: 2-Aug-2017
https://doi.org/10.1007/978-3-319-64471-4_31
Zhu FFang YChang KYing J(2015)Scheduled approximation for Personalized PageRank with Utility-based Hub SelectionThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-014-0376-824:5(655-679)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1007/s00778-014-0376-8
Hu JWei XHe H(2014)Brain Image Segmentation Based on Hypergraph ModelingProceedings of the 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing10.1109/DASC.2014.65(327-332)Online publication date: 24-Aug-2014
https://dl.acm.org/doi/10.1109/DASC.2014.65
Bogdanov PBaumer BBasu PBar-Noy ASingh A(2013)As Strong as the Weakest Link:Mining Diverse Cliques in Weighted GraphsAdvanced Information Systems Engineering10.1007/978-3-642-40988-2_34(525-540)Online publication date: 2013
https://doi.org/10.1007/978-3-642-40988-2_34
Chakraborty AGhosh S(2013)Clustering Hypergraphs for Discovery of Overlapping Communities in FolksonomiesDynamics On and Of Complex Networks, Volume 210.1007/978-1-4614-6729-8_10(201-220)Online publication date: 11-Apr-2013
https://doi.org/10.1007/978-1-4614-6729-8_10
Chakraborty AGhosh SGanguly NMunson EStrohmaier M(2012)Detecting overlapping communities in folksonomiesProceedings of the 23rd ACM conference on Hypertext and social media10.1145/2309996.2310032(213-218)Online publication date: 25-Jun-2012
https://dl.acm.org/doi/10.1145/2309996.2310032
Li YShen H(2011)Anonymizing Hypergraphs with Community PreservationProceedings of the 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies10.1109/PDCAT.2011.21(185-190)Online publication date: 20-Oct-2011
https://dl.acm.org/doi/10.1109/PDCAT.2011.21
Li YShen H(2011)Preventing Identity Disclosure in Hypergraphs2011 IEEE 11th International Conference on Data Mining Workshops10.1109/ICDMW.2011.139(659-665)Online publication date: Dec-2011
https://doi.org/10.1109/ICDMW.2011.139
Giatsoglou MPapadopoulos SVakali A(2011)Massive Graph Management for the Web and Web 2.0New Directions in Web Data Management 110.1007/978-3-642-17551-0_2(19-58)Online publication date: 2011
https://doi.org/10.1007/978-3-642-17551-0_2
Zhang MTakahashi SShigeno M(2010)A MAXIMUM DENSITY SUBSET PROBLEM AND ITS ALGORITHM WITH APPROXIMATE BINARY SEARCHTransactions of the Operations Research Society of Japan10.15807/torsj.53.153(1-13)Online publication date: 2010
https://doi.org/10.15807/torsj.53.1
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten