skip to main content
10.1145/3400903.3400925acmotherconferencesArticle/Chapter ViewAbstractPublication PagesssdbmConference Proceedingsconference-collections
short-paper

Cohesive Subgraph Detection in Large Bipartite Networks

Published: 30 July 2020 Publication History

Abstract

In real-world applications, bipartite graphs are widely used to model the relationships between two types of entities, such as customer-product relationship, gene co-expression, etc. As a fundamental problem, cohesive subgraph detection is of great importance for bipartite graph analysis. In this paper, we propose a novel cohesive subgraph model, named (α, β, ω)-core, which requires each node should have sufficient number of close neighbors. The model emphasizes both the engagement of entities and the strength of connections. To scale for large networks, efficient algorithm is developed to compute the (α, β, ω)-core. Compared with the existing cohesive subgraph models, we conduct the experiments over real-world bipartite graphs to verify the advantages of proposed model and techniques.

References

[1]
Aistis Atminas, Vadim V. Lozin, and Igor Razgon. 2012. Linear time algorithm for computing a small biclique in graphs without long induced paths. In SWAT.
[2]
Danhao Ding, Hui Li, Zhipeng Huang, and Nikos Mamoulis. 2017. Efficient Fault-Tolerant Group Recommendation Using alpha-beta-core. In CIKM.
[3]
Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, and Xuemin Lin. 2020. A survey of community search over big graphs. VLDB Journal (2020).
[4]
Yixiang Fang, Kaiqiang Yu, Reynold Cheng, Laks V. S. Lakshmanan, and Xuemin Lin. 2019. Efficient Algorithms for Densest Subgraph Discovery. PVLDB (2019).
[5]
Boge Liu, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang, and Jingren Zhou. 2019. Efficient (α, β)-core Computation: an Index-based Approach. In WWW.
[6]
Eirini Ntoutsi, Kostas Stefanidis, Katharina Rausch, and Hans-Peter Kriegel. 2011. Strength Lies in Differences: Diversifying Friends for Recommendations through Subspace Clustering. In ICDM.
[7]
Ahmet Erdem Sariyuce and Ali Pinar. 2018. Peeling Bipartite Networks for Dense Subgraph Discovery. In WSDM.
[8]
Quan Yuan, Gao Cong, and Chin-Yew Lin. 2014. COM: a generative model for group recommendation. In KDD.
[9]
Zhaonian Zou. 2016. Bitruss Decomposition of Bipartite Graphs. In DASFAA.

Cited By

View all
  • (2024)Efficient Balanced Signed Biclique Search in Signed Bipartite GraphsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.329672136:3(1069-1083)Online publication date: Mar-2024
  • (2024)Bipartite Graph Analytics: Current Techniques and Future Trends2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00405(01-07)Online publication date: 13-May-2024
  • (2023)Maximum Balanced (k,ϵ)-Bitruss Detection in Signed Bipartite GraphProceedings of the VLDB Endowment10.14778/3632093.363209917:3(332-344)Online publication date: 1-Nov-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
SSDBM '20: Proceedings of the 32nd International Conference on Scientific and Statistical Database Management
July 2020
241 pages
ISBN:9781450388146
DOI:10.1145/3400903
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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 July 2020

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Bipartite graph
  2. cohesive subgraph
  3. community detection

Qualifiers

  • Short-paper
  • Research
  • Refereed limited

Conference

SSDBM 2020

Acceptance Rates

Overall Acceptance Rate 56 of 146 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)30
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Efficient Balanced Signed Biclique Search in Signed Bipartite GraphsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.329672136:3(1069-1083)Online publication date: Mar-2024
  • (2024)Bipartite Graph Analytics: Current Techniques and Future Trends2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00405(01-07)Online publication date: 13-May-2024
  • (2023)Maximum Balanced (k,ϵ)-Bitruss Detection in Signed Bipartite GraphProceedings of the VLDB Endowment10.14778/3632093.363209917:3(332-344)Online publication date: 1-Nov-2023
  • (2023)Distributed (α, β)-Core Decomposition over Bipartite Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00075(909-921)Online publication date: Apr-2023
  • (2022)Efficient Rational Community Detection in Attribute Bipartite GraphsMathematical Problems in Engineering10.1155/2022/44300872022(1-9)Online publication date: 28-Apr-2022
  • (2022)sGrow: Explaining the Scale-Invariant Strength Assortativity of Streaming ButterfliesACM Transactions on the Web10.1145/357240817:3(1-46)Online publication date: 14-Dec-2022
  • (2022)sGrapp: Butterfly Approximation in Streaming GraphsACM Transactions on Knowledge Discovery from Data10.1145/349501116:4(1-43)Online publication date: 8-Jan-2022
  • (2022)Maximal Balanced Signed Biclique Enumeration in Signed Bipartite Graphs2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00187(1887-1899)Online publication date: May-2022
  • (2022)CSS on Bipartite NetworksCohesive Subgraph Search Over Large Heterogeneous Information Networks10.1007/978-3-030-97568-5_3(11-26)Online publication date: 23-Feb-2022
  • (2022)IntroductionCohesive Subgraph Search Over Large Heterogeneous Information Networks10.1007/978-3-030-97568-5_1(1-5)Online publication date: 23-Feb-2022

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media