Skip to main content
SpringerLink
Log in

Efficient maintenance for maximal bicliques in bipartite graph streams

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

Maximal biclique enumeration is a fundamental problem in analysing bipartite graphs, which has a wide range of real applications, such as web mining, recommendation systems, and social network analysis. As real-world bipartite graphs constantly evolve over time, it is useful and necessary to incrementally maintain maximal bicliques in dynamic bipartite graphs. Existing solutions for this problem suffer from the major issue of enumerating duplicate maximal bicliques, which inevitably bring huge computation overhead. In this paper, we devise a novel framework to efficiently maintain maximal bicliques when the graph evolves with edge insertions. There are two major steps, i.e., new maximal biclique enumeration and subsumed maximal biclique enumeration. In particular, we sort edges in order when a batch of edges is inserted or removed. Based on the sequence of edges, we construct a recursion search tree to avoid duplicate new maximal bicliques and non-maximal bicliques. Besides, for subsumed maximal biclique eumeration, we first check the maximality of bicliques in an efficient way, and then delete these are no longer maximal. Furthermore, we also show that our techniques can be easily extended to deal with edge deletions. The experiment results demonstrate the efficiency of our techniques, which show a superior performance over the state-of-the-art method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. http://konect.uni-koblenz.de/

References

  1. Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discret. Appl. Math. 145(1), 11–21 (2004)

    Article  MathSciNet  Google Scholar 

  2. Beutel, A., Xu, W., Guruswami, V., Palow, C., Faloutsos, C.: Copycatch: stopping group attacks by spotting lockstep behavior in social networks. In: Proceedings of the 22nd International Conference on World Wide Web, pp 119–130 (2013)

  3. Chen, C.M., Wang, C.J., Tsai, M.F., Yang, Y.H.: Collaborative similarity embedding for recommender systems. In: The World Wide Web Conference, pp 2637–2643 (2019)

  4. Chen, L., Liu, C., Zhou, R., Xu, J., Li, J.: Efficient exact algorithms for maximum balanced biclique search in bipartite graphs. In: Proceedings of the 2021 International Conference on Management of Data, pp 248–260 (2021)

  5. Damaschke, P.: Enumerating maximal bicliques in bipartite graphs with favorable degree sequences. Inf. Process. Lett. 114(6), 317–321 (2014)

    Article  MathSciNet  Google Scholar 

  6. Das, A., Tirthapura, S.: Incremental maintenance of maximal bicliques in a dynamic bipartite graph. IEEE Transactions on Multi-Scale Computing Systems 4(3), 231–242 (2018)

    Article  Google Scholar 

  7. Deng, H., Lyu, M.R., King, I.: A generalized co-hits algorithm and its application to bipartite graphs. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 239–248 (2009)

  8. Dias, V.M., De Figueiredo, C.M., Szwarcfiter, J.L.: Generating bicliques of a graph in lexicographic order. Theor. Comput. Sci. 337(1-3), 240–248 (2005)

    Article  MathSciNet  Google Scholar 

  9. Dias, V.M., de Figueiredo, C.M., Szwarcfiter, J.L.: On the generation of bicliques of a graph. Discret. Appl. Math. 155(14), 1826–1832 (2007)

    Article  MathSciNet  Google Scholar 

  10. Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using (α, β)-core. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp 2047–2050 (2017)

  11. Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Information Processing Letters 51(4), 207–211 (1994)

    Article  MathSciNet  Google Scholar 

  12. Gély, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques. Discrete Applied Mathematics 157(7), 1447–1459 (2009)

    Article  MathSciNet  Google Scholar 

  13. He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs. Inform. Sci. 572, 277–296 (2021)

    Article  MathSciNet  Google Scholar 

  14. Li, Y., Fan, J., Wang, Y., Tan, K.L.: Influence maximization on social graphs: a survey. IEEE Trans. Knowl. Data Eng. 30(10), 1852–1872 (2018)

    Article  Google Scholar 

  15. Li, Y., Fan, J., Ovchinnikov, G., Karras, P.: Maximizing multifaceted network influence. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp 446–457. IEEE (2019)

  16. Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient (α, β)-core computation: an index-based approach. In: The World Wide Web Conference, pp 1130–1141 (2019)

  17. Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient (α, β)-core computation in bipartite graphs. The VLDB Journal 29(5), 1075–1099 (2020)

    Article  Google Scholar 

  18. Liu, G., Sim, K., Li, J.: Efficient mining of large maximal bicliques. In: International Conference on Data Warehousing and Knowledge Discovery, pp 437–448. Springer (2006)

  19. Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Scandinavian Workshop on Algorithm Theory, pp 260–272. Springer (2004)

  20. Mukherjee, A.P., Tirthapura, S.: Enumerating maximal bicliques from a large graph using mapreduce. IEEE Trans. Serv. Comput. 10(5), 771–784 (2016)

    Article  Google Scholar 

  21. Prisner, E.: Bicliques in graphs i: bounds on their number. Combinatorica 20(1), 109–117 (2000)

    Article  MathSciNet  Google Scholar 

  22. Sanei-Mehri, S.V., Sariyuce, A.E., Tirthapura, S.: Butterfly counting in bipartite networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 2150–2159 (2018)

  23. Sanei-Mehri, S.V., Zhang, Y., Sariyüce, A.E., Tirthapura, S.: Fleet: butterfly estimation from a bipartite graph stream. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp 1201–1210 (2019)

  24. Sarıyüce, A.E., Pinar, A.: Peeling bipartite networks for dense subgraph discovery. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp 504–512 (2018)

  25. Svendsen, M., Mukherjee, A.P., Tirthapura, S.: Mining maximal cliques from a large graph using mapreduce: tackling highly uneven subproblem sizes. Journal of Parallel and Distributed Computing 79, 104–114 (2015)

    Article  Google Scholar 

  26. Wang, J., De Vries, A.P., Reinders, M.J.: Unifying user-based and item-based collaborative filtering approaches by similarity fusion. In: Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval, pp 501–508 (2006)

  27. Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Vertex priority based butterfly counting for large-scale bipartite networks. Proceedings of the VLDB Endowment 12(10), 1139–1152 (2019)

    Article  Google Scholar 

  28. Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp 661–672. IEEE (2020)

  29. Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. The VLDB Journal, pp 1–24 (2021)

  30. Wang, K., Zhang, W., Lin, X., Zhang, Y., Qin, L., Zhang, Y. : Efficient and effective community search on large-scale bipartite graphs. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp 85–96. IEEE (2021)

  31. Wang, R., Liao, M., Qin, C.: An efficient algorithm for enumerating maximal bicliques from a dynamically growing graph. In: The International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, pp 329–337. Springer (2019)

  32. Xu, Y., Cheng, J., Fu, A.W.C., Bu, Y.: Distributed maximal clique computation. In: 2014 IEEE International Congress on Big Data, pp 160–167. IEEE (2014)

  33. Yang, Y., Fang, Y., Orlowska, M.E., Zhang, W., Lin, X.: Efficient bi-triangle counting for large bipartite networks. Proceedings of the VLDB Endowment 14(6), 984–996 (2021)

    Article  Google Scholar 

  34. Zhao, X., Xiao, C., Lin, X., Zhang, W., Wang, Y.: Efficient structure similarity searches: a partition-based approach. The VLDB Journal 27(1), 53–78 (2018)

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported in part by NSFC (Grant No. 62002108, 61872134), Science and Technology Program of Changsha City (Grant kh2005019), Zhejiang Lab (NO.2021KD0AB02), and the Key Area Research Program of Hunan (2019GK2091).

Author information

Authors and Affiliations

  1. The College of Computer Science and Electronic Engineering, Hunan University, Changsha, China

    Ziyi Ma, Yuling Liu, Yikun Hu, Jianye Yang & Chubo Liu

  2. Academy of Military Sciences PLA China, Beijing, China

    Ziyi Ma & Huadong Dai

Authors
  1. Ziyi Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuling Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yikun Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jianye Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Chubo Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Huadong Dai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Yuling Liu or Jianye Yang.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article belongs to the Topical Collection: Special Issue on Large Scale Graph Data Analytics

Guest Editors: Xuemin Lin, Lu Qin, Wenjie Zhang, and Ying Zhang

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ma, Z., Liu, Y., Hu, Y. et al. Efficient maintenance for maximal bicliques in bipartite graph streams. World Wide Web 25, 857–877 (2022). https://doi.org/10.1007/s11280-021-00927-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-021-00927-x

Keywords

Search

Navigation