Efficient critical relationships identification in bipartite networks

Bipartite graphs, which consist of two different types of entities, are widely used to model many real-world applications. In bipartite networks, (α,β)-core is an essential model to measure the entity engagement. In this paper, we propose and investigate the problem of (α,β)-core minimization, which aims to identify a set of b edges whose deletion can minimize the size of resulting collapsed (α,β)-core. To our best knowledge, this is the first work to investigate the (α,β)-core minimization problem in bipartite graph. We prove the problem is NP-hard and our object function is monotonic but not submodular. Then, we propose a baseline algorithm by invoking the greedy framework. To reduce the computation cost and candidate space, novel pruning techniques are devised. We further develop a group based algorithm to optimize the search. Finally, we conduct comprehensive experiments over 6 real-life bipartite networks to demonstrate the advantages of the proposed techniques.

[1]  Xun Wang,et al.  Discovering Cliques in Signed Networks Based on Balance Theory , 2020, DASFAA.

[2]  Hyun Ah Song,et al.  FRAUDAR: Bounding Graph Fraud in the Face of Camouflage , 2016, KDD.

[3]  Xuemin Lin,et al.  K-core Minimization: An Edge Manipulation Approach , 2018, CIKM.

[4]  Fan Zhang,et al.  Pivotal Relationship Identification: The K-Truss Minimization Problem , 2019, IJCAI.

[5]  Vladimir Batagelj,et al.  Generalized two-mode cores , 2015, Soc. Networks.

[6]  Michalis Faloutsos,et al.  Eigen-Optimization on Large Graphs by Edge Manipulation , 2016, ACM Trans. Knowl. Discov. Data.

[7]  Weifa Liang,et al.  Finding maximal k-edge-connected subgraphs from a large graph , 2012, EDBT '12.

[8]  Jun Wang,et al.  Unifying user-based and item-based collaborative filtering approaches by similarity fusion , 2006, SIGIR.

[9]  Tina Eliassi-Rad,et al.  Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the k-Core , 2020, SDM.

[10]  Francesco Bonchi,et al.  Distance-generalized Core Decomposition , 2019, SIGMOD Conference.

[11]  Vladimir Batagelj,et al.  Visualisation and analysis of the internet movie database , 2007, 2007 6th International Asia-Pacific Symposium on Visualization.

[12]  Xuemin Lin,et al.  Efficient (α, β)-core Computation: an Index-based Approach , 2019, WWW.

[13]  Kai Wang,et al.  Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks , 2018, Proc. VLDB Endow..

[14]  Venkatesan Guruswami,et al.  CopyCatch: stopping group attacks by spotting lockstep behavior in social networks , 2013, WWW.

[15]  Jeffrey Xu Yu,et al.  Querying k-truss community in large and dynamic graphs , 2014, SIGMOD Conference.

[16]  S. Lehmann,et al.  Biclique communities. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Jeffrey Xu Yu,et al.  Finding maximal cliques in massive networks by H*-graph , 2010, SIGMOD Conference.

[18]  Xuemin Lin,et al.  Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs , 2021, The VLDB Journal.

[19]  Garry Robins,et al.  Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs , 2004, Comput. Math. Organ. Theory.

[20]  Lu Qin,et al.  Efficient Bitruss Decomposition for Large-scale Bipartite Graphs , 2020, 2020 IEEE 36th International Conference on Data Engineering (ICDE).

[21]  Dorit S. Hochbaum,et al.  Approximating Clique and Biclique Problems , 1998, J. Algorithms.

[22]  Ying Zhang,et al.  Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems , 2020, IEEE Transactions on Knowledge and Data Engineering.

[23]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[24]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[25]  Hui Li,et al.  Efficient Fault-Tolerant Group Recommendation Using alpha-beta-core , 2017, CIKM.

[26]  Xuemin Lin,et al.  Bring Order into the Samples: A Novel Scalable Method for Influence Maximization (Extended Abstract) , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[27]  Bernhard A. Sabel,et al.  Dynamic reorganization of brain functional networks during cognition , 2015, NeuroImage.

[28]  Martin G. Everett,et al.  Network analysis of 2-mode data , 1997 .

[29]  Jun Zhao,et al.  Efficient Personalized Influential Community Search in Large Networks , 2020, APWeb/WAIM.

[30]  Xuemin Lin,et al.  Efficient Distance-Aware Influence Maximization in Geo-Social Networks , 2017, IEEE Transactions on Knowledge and Data Engineering.

[31]  Jinyan Li,et al.  Efficient Mining of Large Maximal Bicliques , 2006, DaWaK.

[32]  Weifa Liang,et al.  Efficiently computing k-edge connected components via graph decomposition , 2013, SIGMOD '13.

[33]  Xiaoyang Wang,et al.  Stable Community Detection in Signed Social Networks , 2022, IEEE Transactions on Knowledge and Data Engineering.

[34]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.