{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T02:39:14Z","timestamp":1783737554995,"version":"3.55.0"},"reference-count":74,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.14778\/3547305.3547318","type":"journal-article","created":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T16:09:53Z","timestamp":1662566993000},"page":"2134-2147","source":"Crossref","is-referenced-by-count":7,"title":["ABC"],"prefix":"10.14778","volume":"15","author":[{"given":"Junghoon","family":"Kim","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaiyu","family":"Feng","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gao","family":"Cong","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Diwen","family":"Zhu","sequence":"additional","affiliation":[{"name":"Alibaba Group, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenyuan","family":"Yu","sequence":"additional","affiliation":[{"name":"Alibaba Group, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunyan","family":"Miao","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806639"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.07.002"},{"key":"e_1_2_1_3_1","volume-title":"Degree-Constrained Subgraph Problems: Hardness and Approximation Results. In Approximation and Online Algorithms: 6th International Workshop, WAOA 2008","author":"Amini Omid","year":"2009","unstructured":"Omid Amini , David Peleg , St\u00e9phane P\u00e9rennes , 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\u00e9phane P\u00e9rennes, 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."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.03.025"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/140991923"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.066102"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1086\/228631"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2015.9"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1105-6"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2014.2307458"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/aabfc8"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.140"},{"key":"e_1_2_1_14_1","volume-title":"Church","author":"Cheng Yizong","year":"2000","unstructured":"Yizong Cheng and George M . Church . 2000 . Biclustering of Expression Data. In ISMB. 93--103. Yizong Cheng and George M. Church. 2000. Biclustering of Expression Data. In ISMB. 93--103."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval (Gold Coast","author":"Cheng Zhiyuan","year":"2014","unstructured":"Zhiyuan Cheng , James Caverlee , Himanshu Barthwal , and Vandana Bachani . 2014 . Who is the barbecue king of texas? A geo-spatial approach to finding local experts on twitter . In Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval (Gold Coast , Queensland, Australia). 335--344. Zhiyuan Cheng, James Caverlee, Himanshu Barthwal, and Vandana Bachani. 2014. Who is the barbecue king of texas? A geo-spatial approach to finding local experts on twitter. In Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval (Gold Coast, Queensland, Australia). 335--344."},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Paul-Alexandru Chirita Wolfgang Nejdl and Cristian Zamfir. 2005. Preventing shilling attacks in online recommender systems. In WIDM. 67--74.  Paul-Alexandru Chirita Wolfgang Nejdl and Cristian Zamfir. 2005. Preventing shilling attacks in online recommender systems. In WIDM. 67--74.","DOI":"10.1145\/1097047.1097061"},{"key":"e_1_2_1_17_1","unstructured":"Eunjoon Cho Seth A Myers and Jure Leskovec. 2011. Friendship and mobility: user movement in location-based social networks. In KDD. 1082--1090.  Eunjoon Cho Seth A Myers and Jure Leskovec. 2011. Friendship and mobility: user movement in location-based social networks. In KDD. 1082--1090."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1997.612321"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"key":"e_1_2_1_20_1","volume-title":"A novel measure of edge centrality in social networks. Knowledge-based systems 30","author":"Meo Pasquale De","year":"2012","unstructured":"Pasquale De Meo , Emilio Ferrara , Giacomo Fiumara , and Angela Ricciardello . 2012. A novel measure of edge centrality in social networks. Knowledge-based systems 30 ( 2012 ), 136--150. Pasquale De Meo, Emilio Ferrara, Giacomo Fiumara, and Angela Ricciardello. 2012. A novel measure of edge centrality in social networks. Knowledge-based systems 30 (2012), 136--150."},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Inderjit S Dhillon. 2001. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD. ACM 269--274.  Inderjit S Dhillon. 2001. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD. ACM 269--274.","DOI":"10.1145\/502512.502550"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Inderjit S Dhillon Subramanyam Mallela and Dharmendra S Modha. 2003. Information-theoretic co-clustering. In KDD. ACM 89--98.  Inderjit S Dhillon Subramanyam Mallela and Dharmendra S Modha. 2003. Information-theoretic co-clustering. In KDD. ACM 89--98.","DOI":"10.1145\/956750.956764"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Chris Ding Tao Li Wei Peng and Haesun Park. 2006. Orthogonal nonnegative matrix t-factorizations for clustering. In KDD. 126--135.  Chris Ding Tao Li Wei Peng and Haesun Park. 2006. Orthogonal nonnegative matrix t-factorizations for clustering. In KDD. 126--135.","DOI":"10.1145\/1150402.1150420"},{"key":"e_1_2_1_24_1","unstructured":"Liang Du and Yi-Dong Shen. 2013. Towards robust co-clustering. In IJCAI. 1317--1322.  Liang Du and Yi-Dong Shen. 2013. Towards robust co-clustering. In IJCAI. 1317--1322."},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Alessandro Epasto Silvio Lattanzi and Renato Paes Leme. 2017. Ego-splitting framework: From non-overlapping to overlapping clusters. In KDD. 145--154.  Alessandro Epasto Silvio Lattanzi and Renato Paes Leme. 2017. Ego-splitting framework: From non-overlapping to overlapping clusters. In KDD. 145--154.","DOI":"10.1145\/3097983.3098054"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Kaiyu Feng Gao Cong Sourav S Bhowmick and Shuai Ma. 2014. In search of influential event organizers in online social networks. In SIGMOD. 63--74.  Kaiyu Feng Gao Cong Sourav S Bhowmick and Shuai Ma. 2014. In search of influential event organizers in online social networks. In SIGMOD. 63--74.","DOI":"10.1145\/2588555.2612173"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_2_1_29_1","unstructured":"Quanquan Gu and Jie Zhou. 2009. Co-clustering on manifolds. In KDD. ACM 359--368.  Quanquan Gu and Jie Zhou. 2009. Co-clustering on manifolds. In KDD. ACM 359--368."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036102"},{"key":"e_1_2_1_31_1","volume-title":"The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis) 5, 4","author":"Maxwell Harper F","year":"2015","unstructured":"F Maxwell Harper and Joseph A Konstan . 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis) 5, 4 ( 2015 ), 1--19. F Maxwell Harper and Joseph A Konstan. 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis) 5, 4 (2015), 1--19."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.056107"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105760"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.09.006"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1038\/35036627"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401969"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1177\/0309132510394118"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_39_1","unstructured":"Junghoon Kim Tao Guo Kaiyu Feng Gao Cong Arijit Khan and Farhana M Choudhury. 2020. Densely Connected User Community and Location Cluster Search in Location-Based Social Networks. In SIGMOD. 2199--2209.  Junghoon Kim Tao Guo Kaiyu Feng Gao Cong Arijit Khan and Farhana M Choudhury. 2020. Densely Connected User Community and Location Cluster Search in Location-Based Social Networks. In SIGMOD. 2199--2209."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391708"},{"key":"e_1_2_1_41_1","volume-title":"Co-clustering for binary and categorical data with maximum modularity","author":"Labiod Lazhar","unstructured":"Lazhar Labiod and Mohamed Nadif . 2011. Co-clustering for binary and categorical data with maximum modularity . In ICDM. IEEE , 1140--1145. Lazhar Labiod and Mohamed Nadif. 2011. Co-clustering for binary and categorical data with maximum modularity. In ICDM. IEEE, 1140--1145."},{"key":"e_1_2_1_42_1","volume-title":"Benchmark graphs for testing community detection algorithms. Physical review E 78, 4","author":"Lancichinetti Andrea","year":"2008","unstructured":"Andrea Lancichinetti , Santo Fortunato , and Filippo Radicchi . 2008. Benchmark graphs for testing community detection algorithms. Physical review E 78, 4 ( 2008 ), 046110. Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi. 2008. Benchmark graphs for testing community detection algorithms. Physical review E 78, 4 (2008), 046110."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/3091622.3091662"},{"key":"e_1_2_1_44_1","volume-title":"H Eugene Stanley, and Yvonne \u00c5berg.","author":"Liljeros Fredrik","year":"2001","unstructured":"Fredrik Liljeros , Christofer R Edling , Luis A Nunes Amaral , H Eugene Stanley, and Yvonne \u00c5berg. 2001 . The web of human sexual contacts. Nature 411, 6840 (2001), 907. Fredrik Liljeros, Christofer R Edling, Luis A Nunes Amaral, H Eugene Stanley, and Yvonne \u00c5berg. 2001. The web of human sexual contacts. Nature 411, 6840 (2001), 907."},{"key":"e_1_2_1_45_1","volume-title":"BlackHole: Robust community detection inspired by graph drawing","author":"Lim Sungsu","unstructured":"Sungsu Lim , Junghoon Kim , and Jae-Gil Lee . 2016. BlackHole: Robust community detection inspired by graph drawing . In ICDE. IEEE , 25--36. Sungsu Lim, Junghoon Kim, and Jae-Gil Lee. 2016. BlackHole: Robust community detection inspired by graph drawing. In ICDE. IEEE, 25--36."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2904314"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3115404.3115407"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P14-5010"},{"key":"e_1_2_1_49_1","volume-title":"Lucene in action","author":"McCandless Michael","unstructured":"Michael McCandless , Erik Hatcher , Otis Gospodneti\u0107 , and O Gospodneti\u0107 . 2010. Lucene in action . Vol. 2 . Manning , Greenwich, USA. Michael McCandless, Erik Hatcher, Otis Gospodneti\u0107, and O Gospodneti\u0107. 2010. Lucene in action. Vol. 2. Manning, Greenwich, USA."},{"key":"e_1_2_1_50_1","volume-title":"LEDA: a platform for combinatorial and geometric computing","author":"Mehlhorn Kurt","unstructured":"Kurt Mehlhorn and Stefan N\u00e4her . 1999. LEDA: a platform for combinatorial and geometric computing . Cambridge university press , Cambridge . Kurt Mehlhorn and Stefan N\u00e4her. 1999. LEDA: a platform for combinatorial and geometric computing. Cambridge university press, Cambridge."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381449"},{"key":"e_1_2_1_52_1","volume-title":"1st International Conference on Learning Representations, ICLR","author":"Mikolov Tom\u00e1s","year":"2013","unstructured":"Tom\u00e1s Mikolov , Kai Chen , Greg Corrado , and Jeffrey Dean . 2013. Efficient Estimation of Word Representations in Vector Space . In 1st International Conference on Learning Representations, ICLR 2013 , Scottsdale, Arizona, USA , May 2-4, 2013, Workshop Track Proceedings, Yoshua Bengio and Yann LeCun (Eds .). Tom\u00e1s Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient Estimation of Word Representations in Vector Space. In 1st International Conference on Learning Representations, ICLR 2013, Scottsdale, Arizona, USA, May 2-4, 2013, Workshop Track Proceedings, Yoshua Bengio and Yann LeCun (Eds.)."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.06.030"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-014-0818-7"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107112"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02466-5_101"},{"key":"e_1_2_1_57_1","volume-title":"Networks: an introduction: OUP Oxford","author":"Newman M","unstructured":"M Newman . 2010. Networks: an introduction: OUP Oxford . Oxford University Press, Oxford , England . M Newman. 2010. Networks: an introduction: OUP Oxford. Oxford University Press, Oxford, England."},{"key":"e_1_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Feng Pan Xiang Zhang and Wei Wang. 2008. CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition. In SIGMOD. 173--184.  Feng Pan Xiang Zhang and Wei Wang. 2008. CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition. In SIGMOD. 173--184.","DOI":"10.1145\/1376616.1376637"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1971.10482356"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v088.i07"},{"key":"e_1_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Aghiles Salah Melissa Ailem and Mohamed Nadif. 2018. Word co-occurrence regularized non-negative matrix tri-factorization for text data co-clustering. In AAAI. 3992--3999.  Aghiles Salah Melissa Ailem and Mohamed Nadif. 2018. Word co-occurrence regularized non-negative matrix tri-factorization for text data co-clustering. In AAAI. 3992--3999.","DOI":"10.1609\/aaai.v32i1.11659"},{"key":"e_1_2_1_63_1","volume-title":"Network structure and minimum degree. Social networks 5, 3","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman . 1983. Network structure and minimum degree. Social networks 5, 3 ( 1983 ), 269--287. Stephen B Seidman. 1983. Network structure and minimum degree. Social networks 5, 3 (1983), 269--287."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.12.015"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2598561"},{"key":"e_1_2_1_67_1","volume-title":"Workshop on artificial intelligence for web search (AAAI","volume":"58","author":"Strehl Alexander","year":"2000","unstructured":"Alexander Strehl , Joydeep Ghosh , and Raymond Mooney . 2000 . Impact of similarity measures on web-page clustering . In Workshop on artificial intelligence for web search (AAAI 2000), Vol. 58 . 64. Alexander Strehl, Joydeep Ghosh, and Raymond Mooney. 2000. Impact of similarity measures on web-page clustering. In Workshop on artificial intelligence for web search (AAAI 2000), Vol. 58. 64."},{"key":"e_1_2_1_68_1","volume-title":"Network embedding for community detection in attributed networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 14, 3","author":"Sun Heli","year":"2020","unstructured":"Heli Sun , Fang He , Jianbin Huang , Yizhou Sun , Yang Li , Chenyu Wang , Liang He , Zhongbin Sun , and Xiaolin Jia . 2020. Network embedding for community detection in attributed networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 14, 3 ( 2020 ), 1--25. Heli Sun, Fang He, Jianbin Huang, Yizhou Sun, Yang Li, Chenyu Wang, Liang He, Zhongbin Sun, and Xiaolin Jia. 2020. Network embedding for community detection in attributed networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 14, 3 (2020), 1--25."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-38965-9_2"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/509"},{"key":"e_1_2_1_71_1","volume-title":"Nonnegative matrix tri-factorization based high-order co-clustering and its fast implementation","author":"Wang Hua","unstructured":"Hua Wang , Feiping Nie , Heng Huang , and Chris Ding . 2011. Nonnegative matrix tri-factorization based high-order co-clustering and its fast implementation . In ICDM. IEEE , 774--783. Hua Wang, Feiping Nie, Heng Huang, and Chris Ding. 2011. Nonnegative matrix tri-factorization based high-order co-clustering and its fast implementation. In ICDM. IEEE, 774--783."},{"key":"e_1_2_1_72_1","volume-title":"Deep Co-Clustering","author":"Xu Dongkuan","unstructured":"Dongkuan Xu , Wei Cheng , Bo Zong , Jingchao Ni , Dongjin Song , Wenchao Yu , Yuncong Chen , Haifeng Chen , and Xiang Zhang . 2019. Deep Co-Clustering . In SDM. SIAM , 414--422. Dongkuan Xu, Wei Cheng, Bo Zong, Jingchao Ni, Dongjin Song, Wenchao Yu, Yuncong Chen, Haifeng Chen, and Xiang Zhang. 2019. Deep Co-Clustering. In SDM. SIAM, 414--422."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330961"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2005.05.044"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330721"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3547305.3547318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:15:04Z","timestamp":1672226104000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3547305.3547318"}},"subtitle":["attributed bipartite co-clustering"],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":74,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["10.14778\/3547305.3547318"],"URL":"https:\/\/doi.org\/10.14778\/3547305.3547318","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,6]]}}}