Abstract
In this paper, we propose a novel cohesive subgraph model to find introverted communities in bipartite graphs, named \((\alpha , \beta , p)\)-core. It is a maximal subgraph in which every vertex in one part has at least \(\alpha \) neighbors and at least p fraction of its neighbors in the subgraph, and every vertex in the other part has at least \(\beta \) neighbors. Compared to the \((\alpha , \beta )\)-core, the additional requirement on the fraction of neighbors in our model ensures that the vertices are introverted in the subgraph regarding their neighbor sets, e.g., for the \((\alpha , \beta )\)-core of a customer-product network, the shopping interests of the customers inside focus on the products in the subgraph. We propose an O(m) algorithm to compute the \((\alpha , \beta , p)\)-core with given \(\alpha , \beta \) and p. Besides, we introduce an efficient algorithm to decompose a graph by the \((\alpha , \beta , p)\)-core. The experiments on real-world data demonstrate that our model is effective and our proposed algorithms are efficient.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 598–612. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45995-2_51
Ahmed, A., Batagelj, V., Fu, X., Hong, S.H., Merrick, D., Mrvar, A.: Visualisation and analysis of the internet movie database. In: 2007 6th International Asia-Pacific Symposium on Visualization, pp. 17–24. IEEE (2007)
Batagelj, V., Zaversnik, M.: An o (m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049 (2003)
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)
Cai, Z., He, Z., Guan, X., Li, Y.: Collective data-sanitization for preventing sensitive information inference attacks in social networks. IEEE Trans. Dependable Secure Comput. 15(4), 577–590 (2016)
Cerinšek, M., Batagelj, V.: Generalized two-mode cores. Soc. Netw. 42, 80–87 (2015)
Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha-beta-core. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 2047–2050 (2017)
Hochbaum, D.S.: Approximating clique and biclique problems. J. Algorithms 29(1), 174–200 (1998)
Kaytoue, M., Kuznetsov, S.O., Napoli, A., Duplessis, S.: Mining gene expression data with pattern structures in formal concept analysis. Inf. Sci. 181(10), 1989–2001 (2011)
Lehmann, S., Schwartz, M., Hansen, L.K.: Biclique communities. Phys. Rev. E 78(1), 016108 (2008)
Ley, M.: The DBLP computer science bibliography: evolution, research issues, perspectives. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 1–10. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45735-6_1
Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient (\(\alpha \), \(\beta \))-core computation: an index-based approach. In: The World Wide Web Conference, pp. 1130–1141 (2019)
Luce, R.D., Perry, A.D.: A method of matrix analysis of group structure. Psychometrika 14(2), 95–116 (1949)
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)
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)
Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269–287 (1983)
Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. J. Math. Sociol. 6(1), 139–154 (1978)
Wang, J., Cheng, J.: Truss decomposition in massive networks. arXiv preprint arXiv:1205.6693 (2012)
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)
Xu, K., Williams, R., Hong, S.-H., Liu, Q., Zhang, J.: Semi-bipartite graph visualization for gene ontology networks. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 244–255. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11805-0_24
Yu, D., Zhang, L., Luo, Q., Cheng, X., Cai, Z.: Core decomposition and maintenance in bipartite graphs. Tsinghua Sci. Technol. 28(2), 292–309 (2022)
Zhang, C., et al.: Exploring finer granularity within the cores: efficient (k, p)-core computation. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 181–192. IEEE (2020)
Zhang, H., Chen, Y., Li, X., Zhao, X.: Simplifying knowledge-aware aggregation for knowledge graph collaborative filtering. In: Zhao, X., Yang, S., Wang, X., Li, J. (eds.) WISA 2022. LNCS, vol. 13579, pp. 52–63. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-20309-1_5
Zhang, Y., Phillips, C.A., Rogers, G.L., Baker, E.J., Chesler, E.J., Langston, M.A.: On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC Bioinform. 15, 1–18 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Shu, K., Liang, Q., Guo, H., Zhang, F., Wang, K., Yuan, L. (2023). Finding Introverted Cores in Bipartite Graphs. In: Yuan, L., Yang, S., Li, R., Kanoulas, E., Zhao, X. (eds) Web Information Systems and Applications. WISA 2023. Lecture Notes in Computer Science, vol 14094. Springer, Singapore. https://doi.org/10.1007/978-981-99-6222-8_14
Download citation
DOI: https://doi.org/10.1007/978-981-99-6222-8_14
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-6221-1
Online ISBN: 978-981-99-6222-8
eBook Packages: Computer ScienceComputer Science (R0)
