research-article

Detecting cohesive and 2-mode communities indirected and undirected networks

Authors:

Julian McAuley,

Jure LeskovecAuthors Info & Claims

WSDM '14: Proceedings of the 7th ACM international conference on Web search and data mining

Pages 323 - 332

https://doi.org/10.1145/2556195.2556243

Published: 24 February 2014 Publication History

Abstract

Networks are a general language for representing relational information among objects. An effective way to model, reason about, and summarize networks, is to discover sets of nodes with common connectivity patterns. Such sets are commonly referred to as network communities. Research on network community detection has predominantly focused on identifying communities of densely connected nodes in undirected networks.

In this paper we develop a novel overlapping community detection method that scales to networks of millions of nodes and edges and advances research along two dimensions: the connectivity structure of communities, and the use of edge directedness for community detection. First, we extend traditional definitions of network communities by building on the observation that nodes can be densely interlinked in two different ways: In cohesive communities nodes link to each other, while in 2-mode communities nodes link in a bipartite fashion, where links predominate between the two partitions rather than inside them. Our method successfully detects both 2-mode as well as cohesive communities, that may also overlap or be hierarchically nested. Second, while most existing community detection methods treat directed edges as though they were undirected, our method accounts for edge directions and is able to identify novel and meaningful community structures in both directed and undirected networks, using data from social, biological, and ecological domains.

References

[1]

L. Adamic and N. Glance. The political blogosphere and the 2004 U.S. election: divided they blog. In LinkKDD '05, 2005.

Digital Library

[2]

Y.-Y. Ahn, J. Bagrow, and S. Lehmann. Link communities reveal multi-scale complexity in networks. Nature, 2010.

[3]

E. Airoldi, D. Blei, S. Fienberg, and E. Xing. Mixed membership stochastic blockmodels. JMLR, 2007.

Digital Library

[4]

R. Andersen and K. Lang. Communities from seed sets. In WWW '06, 2006.

Digital Library

[5]

R. Balasubramanyan and W. Cohen. Block-LDA: Jointly modeling entity-annotated text and entity-entity links. In SDM '11, 2011.

[6]

B. Ball, B. Karrer, and M. Newman. Efficient and principled method for detecting communities in networks. In Phys. Rev. E, 2011.

[7]

E. Boyle et al. GO::TermFinder--open source software for accessing gene ontology information and finding significantly enriched gene ontology terms associated with a list of genes. Bioinformatics, 2004.

Digital Library

[8]

L. Breiger. The duality of persons and groups. Social Forces, 1974.

[9]

R. Burt. Cohesion versus structural equivalence as a basis for network subgroups. Sociological Methods and Research, 1978.

[10]

D. Carney, B. Davies, and B. Horazdovsky. Vps9 domain-containing proteins: activators of Rab5 GTPases from yeast to neurons. Trends in Cell Biology, 2006.

[11]

M. Coscia, G. Rossetti, F. Giannotti, and D. Pedreschi. Demon: a local-first discovery method for overlapping communities. In KDD '12, 2012.

Digital Library

[12]

L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas. Comparing community structure identification. J. of Stat. Mech.: Theory and Experiment, 2005.

[13]

I. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors: A multilevel approach. IEEE PAMI, 2007.

Digital Library

[14]

S. Fortunato. Community detection in graphs. Physics Reports, 2010.

[15]

D. Gleich and Seshadhri. Neighborhoods are good communities. In KDD '12, 2012.

[16]

P. Gopalan, D. Mimno, S. Gerrish, M. Freedman, and D. Blei. Scalable inference of overlapping communities. In NIPS '12, 2012.

[17]

K. Henderson, B. Gallagher, T. Eliassi-Rad, H. Tong, S. Basu, L. Akoglu, D. Koutra, C. Faloutsos, and L. Li. Rolx: structural role extraction & mining in large graphs. In KDD, 2012.

Digital Library

[18]

P. W. Holland, K. B. Laskey, and S. Leinhardt. Stochastic blockmodels: First steps. Social Networks, 1983.

[19]

C.-J. Hsieh and I. S. Dhillon. Fast coordinate descent methods with variable selection for non-negative matrix factorization. In KDD '11, 2011.

Digital Library

[20]

S. Johnson. Hierarchical clustering schemes. Psychometrika, 1967.

[21]

G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. J. of Parallel and Distributed Computing, 1998.

Digital Library

[22]

B. Klimt and Y. Yang. Introducing the enron corpus. In CEAS '04, 2004.

[23]

R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cyber-communities. Computer Networks, 1999.

Digital Library

[24]

H. Kwak, C. Lee, H. Park, and S. Moon. What is twitter, a social network or a news media? In WWW '10, 2010.

Digital Library

[25]

S. Lattanzi and D. Sivakumar. Affiliation networks. In STOC '09, 2009.

Digital Library

[26]

E. Leicht and M. E. Newman. Community structure in directed networks. Phys. Rev. Lett., 2008.

[27]

J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD '05, 2005.

Digital Library

[28]

J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 2009.

[29]

C-J. Lin. Projected Gradient Methods for Nonnegative Matrix Factorization. Neural Computation, 2007.

Digital Library

[30]

F. Malliaros and M. Vazirgiannis. Clustering and Community Detection in Directed Networks: A Survey. Physics Reports, 2013.

[31]

J. McAuley and J. Leskovec. Learning to discover social circles in ego networks. In NIPS '12, 2012.

[32]

A. McCallum, X. Wang, and A. Corrada-Emmanuel. Topic and role discovery in social networks with experiments on enron and academic email. JAIR, 2007.

Digital Library

[33]

A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC '07, 2007.

Digital Library

[34]

G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 2005.

[35]

S. Papadopoulos, Y. Kompatsiaris, A. Vakali, and P. Spyridonos. Community detection in social media. DMKD, 2011.

Digital Library

[36]

S. Pinkert, J. Schultz, and J. Reichardt. Protein interaction networks---more than mere modules. PLoS CompBio, 2010.

[37]

F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and identifying communities in networks. PNAS, 2004.

[38]

M. Rosvall and C. Bergstrom. An information-theoretic framework for resolving community structure in complex networks. PNAS, 2007.

[39]

M. Rosvall and C. T. Bergstrom. Maps of random walks on complex networks reveal community structure. PNAS, 2008.

[40]

V. Satuluri and S. Parthasarathy. Scalable Graph Clustering using Stochastic Flows: Applications to Community Discovery. KDD '09, 2009.

Digital Library

[41]

R. Ulanowicz, C. Bondavalli, and M. Egnotovich. Network analysis of trophic dynamics in south florida ecosystem, fy 97: The florida bay ecosystem. Ref. CBL98-123. Chesapeake Biological Laboratory, 1998.

[42]

J. Xie, S. Kelley, and B. K. Szymanski. Overlapping community detection in networks: the state of the art and comparative study. ACM Computing Surveys, 2013.

Digital Library

[43]

J. Yang and J. Leskovec. Community-affiliation network model for overlapping community detection. In ICDM '12, 2012.

Digital Library

[44]

J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. In ICDM '12, 2012.

Digital Library

[45]

J. Yang and J. Leskovec. Overlapping community detection at scale: A non-negative factorization approach. In WSDM '13, 2013.

Digital Library

[46]

H. Yu, P. Braun, M. A. Yildirim, I. Lemmens, K. Venkatesan, J. Sahalie, T. Hirozane-Kishikawa, F. Gebreab, N. Li, N. Simonis, and et al. High-quality binary protein interaction map of the yeast interactome network. Science, 2008.

[47]

E. Zheleva, H. Sharara, and L. Getoor. Co-evolution of social and affiliation networks. In KDD '09, 2009.

Digital Library

Cited By

Jiang WHe HLin LTang QWang R(2023)Counterfactual Reasoning Over Community Detection: A Case Study of the Public Science Day CommunityJournal of Social Computing10.23919/JSC.2023.00104:2(125-138)Online publication date: Jun-2023
https://doi.org/10.23919/JSC.2023.0010
Sun LDu YGao SYe JWang FRen FLiang MWang YWang S(2023)GroupAligner: A Deep Reinforcement Learning with Domain Adaptation for Social Group AlignmentACM Transactions on the Web10.1145/358050917:3(1-30)Online publication date: 22-May-2023
https://dl.acm.org/doi/10.1145/3580509
Zheng ZShi XJin H(2023)Parallel Overlapping Community Detection Algorithm on GPUIEEE Transactions on Big Data10.1109/TBDATA.2022.31803609:2(677-687)Online publication date: 1-Apr-2023
https://doi.org/10.1109/TBDATA.2022.3180360
Show More Cited By

Index Terms

Detecting cohesive and 2-mode communities indirected and undirected networks
1. Information systems
  1. Information systems applications
    1. Data mining

Recommendations

Overlapping community detection at scale: a nonnegative matrix factorization approach
WSDM '13: Proceedings of the sixth ACM international conference on Web search and data mining

Network communities represent basic structures for understanding the organization of real-world networks. A community (also referred to as a module or a cluster) is typically thought of as a group of nodes with more connections amongst its members than ...
Structure and Overlaps of Ground-Truth Communities in Networks
Special Issue on Linking Social Granularity and Functions

One of the main organizing principles in real-world networks is that of network communities, where sets of nodes organize into densely linked clusters. Even though detection of such communities is of great interest, understanding the structure ...
Defining and evaluating network communities based on ground-truth

Nodes in real-world networks organize into densely linked communities where edges appear with high concentration among the members of the community. Identifying such communities of nodes has proven to be a challenging task due to a plethora of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WSDM '14: Proceedings of the 7th ACM international conference on Web search and data mining

February 2014

712 pages

ISBN:9781450323512

DOI:10.1145/2556195

General Chairs:
Ben Carterette
University of Delaware, USA
,
Fernando Diaz
Microsoft Research, USA
,
Program Chairs:
Carlos Castillo
Qatar Computing Research Institute, Qatar
,
Donald Metzler
Google, USA

Copyright © 2014 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: 24 February 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

WSDM 2014

Sponsor:

WSDM 2014: Seventh ACM International Conference on Web Search and Data Mining

February 24 - 28, 2014

New York, New York, USA

Acceptance Rates

WSDM '14 Paper Acceptance Rate 64 of 355 submissions, 18%;

Overall Acceptance Rate 498 of 2,863 submissions, 17%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

51
Total Citations
View Citations
494
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)1

Reflects downloads up to 31 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jiang WHe HLin LTang QWang R(2023)Counterfactual Reasoning Over Community Detection: A Case Study of the Public Science Day CommunityJournal of Social Computing10.23919/JSC.2023.00104:2(125-138)Online publication date: Jun-2023
https://doi.org/10.23919/JSC.2023.0010
Sun LDu YGao SYe JWang FRen FLiang MWang YWang S(2023)GroupAligner: A Deep Reinforcement Learning with Domain Adaptation for Social Group AlignmentACM Transactions on the Web10.1145/358050917:3(1-30)Online publication date: 22-May-2023
https://dl.acm.org/doi/10.1145/3580509
Zheng ZShi XJin H(2023)Parallel Overlapping Community Detection Algorithm on GPUIEEE Transactions on Big Data10.1109/TBDATA.2022.31803609:2(677-687)Online publication date: 1-Apr-2023
https://doi.org/10.1109/TBDATA.2022.3180360
Reihanian AFeizi-Derakhshi MAghdasi H(2023)An enhanced multi-objective biogeography-based optimization for overlapping community detection in social networks with node attributesInformation Sciences10.1016/j.ins.2022.11.125622(903-929)Online publication date: Apr-2023
https://doi.org/10.1016/j.ins.2022.11.125
Yao KYang XChang L(2023)On Directed Densest Subgraph DetectionDatabases Theory and Applications10.1007/978-3-031-47843-7_26(371-384)Online publication date: 7-Nov-2023
https://doi.org/10.1007/978-3-031-47843-7_26
Zhu JWang CGao CZhang FWang ZLi X(2022)Community Detection in Graph: An Embedding MethodIEEE Transactions on Network Science and Engineering10.1109/TNSE.2021.31303219:2(689-702)Online publication date: 1-Mar-2022
https://doi.org/10.1109/TNSE.2021.3130321
He TBai LOng Y(2022)Vicinal Vertex Allocation for Matrix Factorization in NetworksIEEE Transactions on Cybernetics10.1109/TCYB.2021.305160652:8(8047-8060)Online publication date: Aug-2022
https://doi.org/10.1109/TCYB.2021.3051606
Hosseini-Pozveh MGhorbanian MTabaiyan M(2022)A label propagation-based method for community detection in directed signed social networksPhysica A: Statistical Mechanics and its Applications10.1016/j.physa.2022.127875604(127875)Online publication date: Oct-2022
https://doi.org/10.1016/j.physa.2022.127875
Peng YZhang BChang F(2021)Overlapping Community Detection of Bipartite Networks Based on a Novel Community DensityFuture Internet10.3390/fi1304008913:4(89)Online publication date: 31-Mar-2021
https://doi.org/10.3390/fi13040089
Yao LHe T(2021)Fuzzy Community Detection with Multi-View Correlated TopicsIEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology10.1145/3498851.3498971(307-313)Online publication date: 14-Dec-2021
https://dl.acm.org/doi/10.1145/3498851.3498971
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.

Media

Figures

Other

Tables

View Table of Contents