{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T20:15:52Z","timestamp":1777666552133,"version":"3.51.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T00:00:00Z","timestamp":1706140800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T00:00:00Z","timestamp":1706140800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001774","name":"University of Sydney","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001774","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Bipartite graphs have been widely used to model the relationship between entities of different types, where vertices are partitioned into two disjoint sets\/sides. Finding dense subgraphs in a bipartite graph is of great significance and encompasses many applications. However, none of the existing dense bipartite subgraph models consider similarity between vertices from the same side, and as a result, the identified results may include vertices that are not similar to each other. In this work, we formulate the notion of similar-biclique which is a special kind of biclique where all vertices from a designated side are similar to each other and aim to enumerate all similar-bicliques. The naive approach of first enumerating all maximal bicliques and then extracting all maximal similar-bicliques from them is inefficient, as enumerating maximal bicliques is already time consuming. We propose a backtracking algorithm <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{MSBE}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>MSBE<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> to directly enumerate maximal similar-bicliques and power it by vertex reduction and optimization techniques. In addition, we design a novel index structure to speed up a time-critical operation of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{MSBE}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>MSBE<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, as well as to speed up vertex reduction. Efficient index construction algorithms are developed. To handle dynamic graph updates, we also propose algorithms and optimization techniques for maintaining our index. Finally, we parallelize our index construction algorithms to exploit multiple CPU cores. Extensive experiments on 17 bipartite graphs as well as case studies are conducted to demonstrate the effectiveness and efficiency of our model and algorithms.<\/jats:p>","DOI":"10.1007\/s00778-023-00834-9","type":"journal-article","created":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T15:29:08Z","timestamp":1706196548000},"page":"703-726","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Identifying similar-bicliques in bipartite graphs"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2570-2741","authenticated-orcid":false,"given":"Kai","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,25]]},"reference":[{"key":"834_CR1","doi-asserted-by":"crossref","unstructured":"Abidi, A., Zhou, R., Chen, L., Liu, C.: Pivot-based maximal biclique enumeration. In: IJCAI, pp. 3558\u20133564 (2020)","DOI":"10.24963\/ijcai.2020\/492"},{"issue":"3","key":"834_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Netw. 25(3), 211\u2013230 (2003)","journal-title":"Soc. Netw."},{"issue":"1","key":"834_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2003.09.004","volume":"145","author":"G Alexe","year":"2004","unstructured":"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\u201321 (2004)","journal-title":"Discret. Appl. Math."},{"key":"834_CR4","doi-asserted-by":"crossref","unstructured":"Allahbakhsh, M., Ignjatovic, A., Benatallah, B., Beheshti, S.-M.-R., Bertino, E., Foo, N.: Collusion detection in online rating systems. In: Asia-Pacific Web Conference, pp. 196\u2013207. Springer (2013)","DOI":"10.1007\/978-3-642-37401-2_21"},{"issue":"9","key":"834_CR5","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"2","key":"834_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/TKDE.2016.2618795","volume":"29","author":"L Chang","year":"2017","unstructured":"Chang, L., Wei Li, L., Qin, W.Z., Yang, S.: pscan: fast and exact structural graph clustering. IEEE Trans. Knowl. Data Eng. 29(2), 387\u2013401 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"834_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00453-012-9632-8","volume":"66","author":"L Chang","year":"2013","unstructured":"Chang, L., Yu, J.X., Qin, L.: Fast maximal cliques enumeration in sparse graphs. Algorithmica 66(1), 173\u2013186 (2013)","journal-title":"Algorithmica"},{"issue":"8","key":"834_CR8","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.14778\/3529337.3529341","volume":"15","author":"L Chen","year":"2022","unstructured":"Chen, L., Liu, C., Zhou, R., Jiajie, X., Li, J.: Efficient maximal biclique enumeration for large sparse bipartite graphs. Proc. VLDB Endow. 15(8), 1559\u20131571 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"834_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: Proceedings of KDD\u201912, pp. 1240\u20131248 (2012)","DOI":"10.1145\/2339530.2339724"},{"key":"834_CR10","doi-asserted-by":"crossref","unstructured":"Dave, V., Guha, S., Zhang, Y.: Viceroi: catching click-spam in search ad networks. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, pp. 765\u2013776 (2013)","DOI":"10.1145\/2508859.2516688"},{"issue":"3","key":"834_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/1932409","volume":"26","author":"LR Dice","year":"1945","unstructured":"Dice, L.R.: Measures of the amount of ecologic association between species. Ecology 26(3), 297\u2013302 (1945)","journal-title":"Ecology"},{"key":"834_CR12","doi-asserted-by":"crossref","unstructured":"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\u20132050 (2017)","DOI":"10.1145\/3132847.3133130"},{"key":"834_CR13","doi-asserted-by":"crossref","unstructured":"El Bacha, R.L, Zin, T.T.: Ranking of influential users based on user-tweet bipartite graph. In: 2018 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI), pp. 97\u2013101. IEEE (2018)","DOI":"10.1109\/SOLI.2018.8476770"},{"issue":"4","key":"834_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Inf. Process. Lett. 51(4), 207\u2013211 (1994)","journal-title":"Inf. Process. Lett."},{"key":"834_CR15","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: International Symposium on Algorithms and Computation, pp. 403\u2013414. Springer (2010)","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"834_CR16","doi-asserted-by":"crossref","unstructured":"Gangireddy, S.C.R., Long, C., Chakraborty, T.: Unsupervised fake news detection: a graph-based approach. In: Proceedings of the 31st ACM Conference on Hypertext and Social Media, pp. 75\u201383 (2020)","DOI":"10.1145\/3372923.3404783"},{"key":"834_CR17","unstructured":"Hochbaum, D.S.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Approximation Algorithms for NP-Hard Problems, pp. 94\u2013143 (1996)"},{"key":"834_CR18","doi-asserted-by":"crossref","unstructured":"Hooi, B., Song, H.A., Beutel, A., Shah, N., Shin, K., Faloutsos, C.: Fraudar: bounding graph fraud in the face of camouflage. In: Proceedings of KDD\u201916 (2016)","DOI":"10.1145\/2939672.2939747"},{"key":"834_CR19","first-page":"241","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard, P.: Distribution de la flore alpine dans le bassin des dranses et dans quelques r\u00e9gions voisines. Bull. Soc. Vaudoise Sci. Nat. 37, 241\u2013272 (1901)","journal-title":"Bull. Soc. Vaudoise Sci. Nat."},{"key":"834_CR20","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: Proceedings of KDD\u201902, pp. 538\u2013543 (2002)","DOI":"10.1145\/775107.775126"},{"key":"834_CR21","doi-asserted-by":"crossref","unstructured":"Jiang, M., Cui, P., Beutel, A., Faloutsos, C., Yang, S.: Catchsync: catching synchronized behavior in large directed graphs. In: Proceedings of KDD\u201914, pp. 941\u2013950 (2014)","DOI":"10.1145\/2623330.2623632"},{"issue":"1","key":"834_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"key":"834_CR23","doi-asserted-by":"crossref","unstructured":"Kloster, K., Sullivan, B.D., van\u00a0der Poel, A.: Mining maximal induced bicliques using odd cycle transversals. In: Proceedings of the 2019 SIAM International Conference on Data Mining, SDM 2019, Calgary, Alberta, Canada, May 2\u20134, 2019, pp. 324\u2013332 (2019)","DOI":"10.1137\/1.9781611975673.37"},{"issue":"11\u201316","key":"834_CR24","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R Kumar","year":"1999","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. Comput. Netw. 31(11\u201316), 1481\u20131493 (1999)","journal-title":"Comput. Netw."},{"key":"834_CR25","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"issue":"4","key":"834_CR26","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/A:1013970520933","volume":"18","author":"SO Kuznetsov","year":"2001","unstructured":"Kuznetsov, S.O.: On computing the size of a lattice and related decision problems. Order 18(4), 313\u2013321 (2001)","journal-title":"Order"},{"issue":"1","key":"834_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.016108","volume":"78","author":"S Lehmann","year":"2008","unstructured":"Lehmann, S., Schwartz, M.: Biclique communities. Phys. Rev. E 78(1), 016108 (2008)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"834_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"EA Leicht","year":"2006","unstructured":"Leicht, E.A., Holme, P., Newman, M.E.J.: Vertex similarity in networks. Phys. Rev. E 73(2), 026120 (2006)","journal-title":"Phys. Rev. E"},{"key":"834_CR29","doi-asserted-by":"crossref","unstructured":"Ley, M.: The dblp computer science bibliography: Evolution, research issues, perspectives. In: International Symposium on String Processing and Information Retrieval, pp. 1\u201310. Springer (2002)","DOI":"10.1007\/3-540-45735-6_1"},{"key":"834_CR30","doi-asserted-by":"crossref","unstructured":"Li, J., Li, H., Soh, D., Wong, L.: A correspondence between maximal complete bipartite subgraphs and closed patterns. In: European Conference on Principles of Data Mining and Knowledge Discovery, pp. 146\u2013156. Springer (2005)","DOI":"10.1007\/11564126_18"},{"issue":"12","key":"834_CR31","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1109\/TKDE.2007.190660","volume":"19","author":"J Li","year":"2007","unstructured":"Li, J., Liu, G., Li, H., Wong, L.: Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms. IEEE Trans. Knowl. Data Eng. 19(12), 1625\u20131637 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"7","key":"834_CR32","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inform. Sci. Technol. 58(7), 1019\u20131031 (2007)","journal-title":"J. Am. Soc. Inform. Sci. Technol."},{"issue":"1","key":"834_CR33","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10115-011-0427-z","volume":"32","author":"Z Lin","year":"2012","unstructured":"Lin, Z., Lyu, M.R., King, I.: Matchsim: a novel similarity measure based on maximum neighborhood matching. Knowl. Inf. Syst. 32(1), 141\u2013166 (2012)","journal-title":"Knowl. Inf. Syst."},{"key":"834_CR34","doi-asserted-by":"crossref","unstructured":"Liu, G., Sim, K., Li, J.: Efficient mining of large maximal bicliques. In: International Conference on Data Warehousing and Knowledge Discovery, pp. 437\u2013448. Springer (2006)","DOI":"10.1007\/11823728_42"},{"key":"834_CR35","doi-asserted-by":"crossref","unstructured":"Liu, X., Li, J., Wang, L.: Quasi-bicliques: Complexity and binding pairs. In: International Computing and Combinatorics Conference, pp. 255\u2013264. Springer (2008)","DOI":"10.1007\/978-3-540-69733-6_26"},{"issue":"6","key":"834_CR36","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc, L., Zhou, T.: Link prediction in complex networks: a survey. Phys. A 390(6), 1150\u20131170 (2011)","journal-title":"Phys. A"},{"key":"834_CR37","doi-asserted-by":"crossref","unstructured":"Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., Zhou, J.: Maximum biclique search at billion scale. In: Proceedings of the VLDB Endowment (2020)","DOI":"10.14778\/3397230.3397234"},{"key":"834_CR38","doi-asserted-by":"crossref","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Scandinavian Workshop on Algorithm Theory, pp. 260\u2013272. Springer (2004)","DOI":"10.1007\/978-3-540-27810-8_23"},{"issue":"4","key":"834_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2016","unstructured":"Mart\u00ednez, V., Berzal, F., Cubero, J.-C.: A survey of link prediction in complex networks. ACM Comput. Surv. (CSUR) 49(4), 1\u201333 (2016)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"2","key":"834_CR40","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/0604028","volume":"4","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N., Zemel, E., Hakimi, S.L.: The maximum coverage location problem. SIAM J. Algebr. Discrete Methods 4(2), 253\u2013261 (1983)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"3","key":"834_CR41","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is np-complete. Discret. Appl. Math. 131(3), 651\u2013654 (2003)","journal-title":"Discret. Appl. Math."},{"key":"834_CR42","first-page":"169","volume-title":"Automatic Text Processing: the Transformation, Analysis, and Retrieval of","author":"G Salton","year":"1989","unstructured":"Salton, G.: Automatic Text Processing: the Transformation, Analysis, and Retrieval of, p. 169. Addison-Wesley, Reading (1989)"},{"issue":"7","key":"834_CR43","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1093\/molbev\/msg115","volume":"20","author":"MJ Sanderson","year":"2003","unstructured":"Sanderson, M.J., Driskell, A.C., Ree, R.H., Eulenstein, O., Langley, S.: Obtaining maximal concatenated phylogenetic data sets from large sequence databases. Mol. Biol. Evolut 20(7), 1036\u20131042 (2003)","journal-title":"Mol. Biol. Evolut"},{"key":"834_CR44","doi-asserted-by":"crossref","unstructured":"Sar\u0131y\u00fcce, A.E., Pinar, A.: Peeling bipartite networks for dense subgraph discovery. In: Proceedings of WSDM\u201918, pp. 504\u2013512 (2018)","DOI":"10.1145\/3159652.3159678"},{"key":"834_CR45","doi-asserted-by":"crossref","unstructured":"Satuluri, V., Parthasarathy, S., Ruan, Y.: Local graph sparsification for scalable clustering. In: Proceedings of SIGMOD\u201911, pp. 721\u2013732 (2011)","DOI":"10.1145\/1989323.1989399"},{"key":"834_CR46","doi-asserted-by":"crossref","unstructured":"Su, X., Khoshgoftaar, T.M: A survey of collaborative filtering techniques. In: Advances in Artificial Intelligence, 2009 (2009)","DOI":"10.1155\/2009\/421425"},{"issue":"1","key":"834_CR47","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theoret. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"834_CR48","doi-asserted-by":"crossref","unstructured":"Tseng, T., Dhulipala, L., Shun, J.: Parallel index-based structural graph clustering and its approximation. In: Proceedings of SIGMOD\u201921, pp. 1851\u20131864 (2021)","DOI":"10.1145\/3448016.3457278"},{"key":"834_CR49","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H., et\u00a0al.: Lcm ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Fimi, vol. 126 (2004)","DOI":"10.1145\/1133905.1133916"},{"key":"834_CR50","doi-asserted-by":"crossref","unstructured":"Wang, J., De\u00a0Vries, A.P., Reinders, M.J.T.: 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\u2013508 (2006)","DOI":"10.1145\/1148170.1148257"},{"key":"834_CR51","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ins.2018.03.036","volume":"448","author":"X Wang","year":"2018","unstructured":"Wang, X., Liu, J.: A comparative study of the measures for evaluating community structure in bipartite networks. Inf. Sci. 448, 249\u2013262 (2018)","journal-title":"Inf. Sci."},{"issue":"11","key":"834_CR52","doi-asserted-by":"publisher","first-page":"3085","DOI":"10.14778\/3551793.3551854","volume":"15","author":"K Yao","year":"2022","unstructured":"Yao, K., Chang, L., Yu, J.X.: Identifying similar-bicliques in bipartite graphs. Proc. VLDB Endow. 15(11), 3085\u20133097 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"834_CR53","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ins.2015.07.036","volume":"326","author":"S-H Yoon","year":"2016","unstructured":"Yoon, S.-H., Kim, S.-W., Park, S.: C-rank: a link-based similarity measure for scientific literature databases. Inf. Sci. 326, 25\u201340 (2016)","journal-title":"Inf. Sci."},{"key":"834_CR54","doi-asserted-by":"crossref","unstructured":"Yu, K., Long, C., Deepak, P., Chakraborty, T.: On efficient large maximal biplex discovery. IEEE Trans. Knowl. Data Eng. (2021)","DOI":"10.1109\/TKDE.2021.3077071"},{"key":"834_CR55","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: Charm: an efficient algorithm for closed itemset mining. In: Proceedings of the 2002 SIAM International Conference on Data Mining, pp. 457\u2013473. SIAM (2002)","DOI":"10.1137\/1.9781611972726.27"},{"issue":"1","key":"834_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-15-110","volume":"15","author":"Y Zhang","year":"2014","unstructured":"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 Bioinf. 15(1), 1\u201318 (2014)","journal-title":"BMC Bioinf."},{"key":"834_CR57","doi-asserted-by":"crossref","unstructured":"Zhang, Z.-Y., Ahn, Y.-Y.: Community detection in bipartite networks using weighted symmetric binary matrix factorization. Int. J. Mod. Phys. C 26(09), 1550096 (2015)","DOI":"10.1142\/S0129183115500965"},{"key":"834_CR58","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: a comprehensive structural similarity measure over information networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 553\u2013562 (2009)","DOI":"10.1145\/1645953.1646025"},{"key":"834_CR59","doi-asserted-by":"crossref","unstructured":"Zou, Z.: Bitruss decomposition of bipartite graphs. In: International Conference on Database Systems for Advanced Applications, pp. 218\u2013233. Springer (2016)","DOI":"10.1007\/978-3-319-32049-6_14"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00834-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-023-00834-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00834-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T07:05:22Z","timestamp":1713855922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-023-00834-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,25]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["834"],"URL":"https:\/\/doi.org\/10.1007\/s00778-023-00834-9","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,25]]},"assertion":[{"value":"2 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}