ABC-Reference-Cited by-同舟云学术

ABC

Published:2022-06 Issue:10 Volume:15 Page:2134-2147
ISSN:2150-8097
Container-title:Proceedings of the VLDB Endowment
language:en
Short-container-title:Proc. VLDB Endow.

Author:

Kim Junghoon¹,Feng Kaiyu²,Cong Gao¹,Zhu Diwen³,Yu Wenyuan³,Miao Chunyan¹

Affiliation:

1. Nanyang Technological University, Singapore

2. Beijing Institute of Technology, China

3. Alibaba Group, China

Abstract

Finding a set of co-clusters in a bipartite network is a fundamental and important problem. In this paper, we present the Attributed Bipartite Co-clustering (ABC) problem which unifies two main concepts: (i) bipartite modularity optimization, and (ii) attribute cohesiveness. To the best of our knowledge, this is the first work to find co-clusters while considering the attribute cohesiveness. We prove that ABC is NP-hard and is not in APX, unless P=NP. We propose three algorithms: (1) a top-down algorithm; (2) a bottom-up algorithm; (3) a group matching algorithm. Extensive experimental results on real-world attributed bipartite networks demonstrate the efficiency and effectiveness of our algorithms.

Publisher

Association for Computing Machinery (ACM)

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Link

https://dl.acm.org/doi/pdf/10.14778/3547305.3547318

Reference74 articles.

1. Co-clustering Document-term Matrices by Direct Maximization of Graph Modularity

2. Graph modularity maximization as an effective method for co-clustering text data

3. Omid Amini , David Peleg , Stéphane Pérennes , Ignasi Sau , and Saket Saurabh . 2009 . Degree-Constrained Subgraph Problems: Hardness and Approximation Results. In Approximation and Online Algorithms: 6th International Workshop, WAOA 2008 , Karlsruhe, Germany , September 18-19, 2008. Revised Papers. 29--42. Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, and Saket Saurabh. 2009. Degree-Constrained Subgraph Problems: Hardness and Approximation Results. In Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers. 29--42.

4. On the approximability of some degree-constrained subgraph problems

5. Updating and Downdating Techniques for Optimizing Network Communicability

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Effective Clustering on Large Attributed Bipartite Graphs;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs;Proceedings of the VLDB Endowment;2024-07

3. Experimental analysis and evaluation of cohesive subgraph discovery;Information Sciences;2024-06

4. Neural Attributed Community Search at Billion Scale;Proceedings of the ACM on Management of Data;2023-12-08

5. Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core Approach;Proceedings of the 32nd ACM International Conference on Information and Knowledge Management;2023-10-21