{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:58:33Z","timestamp":1743011913393,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819962211"},{"type":"electronic","value":"9789819962228"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-6222-8_14","type":"book-chapter","created":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T12:16:27Z","timestamp":1694175387000},"page":"162-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding Introverted Cores in\u00a0Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Kaiyuan","family":"Shu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haicheng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,9]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 598\u2013612. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45995-2_51"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"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\u201324. IEEE (2007)","DOI":"10.1109\/APVIS.2007.329304"},{"key":"14_CR3","unstructured":"Batagelj, V., Zaversnik, M.: An o (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013130 (2013)","DOI":"10.1145\/2488388.2488400"},{"issue":"4","key":"14_CR5","first-page":"577","volume":"15","author":"Z Cai","year":"2016","unstructured":"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\u2013590 (2016)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.socnet.2015.04.001","volume":"42","author":"M Cerin\u0161ek","year":"2015","unstructured":"Cerin\u0161ek, M., Batagelj, V.: Generalized two-mode cores. Soc. Netw. 42, 80\u201387 (2015)","journal-title":"Soc. Netw."},{"key":"14_CR7","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"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.1998.0964","volume":"29","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S.: Approximating clique and biclique problems. J. Algorithms 29(1), 174\u2013200 (1998)","journal-title":"J. Algorithms"},{"issue":"10","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1989","DOI":"10.1016\/j.ins.2010.07.007","volume":"181","author":"M Kaytoue","year":"2011","unstructured":"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\u20132001 (2011)","journal-title":"Inf. Sci."},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.016108","volume":"78","author":"S Lehmann","year":"2008","unstructured":"Lehmann, S., Schwartz, M., Hansen, L.K.: Biclique communities. Phys. Rev. E 78(1), 016108 (2008)","journal-title":"Phys. Rev. E"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45735-6_1","volume-title":"String Processing and Information Retrieval","author":"M Ley","year":"2002","unstructured":"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\u201310. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45735-6_1"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"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\u20131141 (2019)","DOI":"10.1145\/3308558.3313522"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce, R.D., Perry, A.D.: A method of matrix analysis of group structure. Psychometrika 14(2), 95\u2013116 (1949)","journal-title":"Psychometrika"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"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\u20132159 (2018)","DOI":"10.1145\/3219819.3220097"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Sar\u0131y\u00fcce, 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\u2013512 (2018)","DOI":"10.1145\/3159652.3159678"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. J. Math. Sociol. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Sociol."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. arXiv preprint arXiv:1205.6693 (2012)","DOI":"10.14778\/2311906.2311909"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013508 (2006)","DOI":"10.1145\/1148170.1148257"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-11805-0_24","volume-title":"Graph Drawing","author":"K Xu","year":"2010","unstructured":"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\u2013255. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_24"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"292","DOI":"10.26599\/TST.2021.9010091","volume":"28","author":"D Yu","year":"2022","unstructured":"Yu, D., Zhang, L., Luo, Q., Cheng, X., Cai, Z.: Core decomposition and maintenance in bipartite graphs. Tsinghua Sci. Technol. 28(2), 292\u2013309 (2022)","journal-title":"Tsinghua Sci. Technol."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"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\u2013192. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00023"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-031-20309-1_5","volume-title":"Web Information Systems and Applications","author":"H Zhang","year":"2022","unstructured":"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\u201363. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20309-1_5"},{"key":"14_CR24","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 Bioinform. 15, 1\u201318 (2014)","journal-title":"BMC Bioinform."}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-6222-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:34:02Z","timestamp":1710232442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-6222-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819962211","9789819962228"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-6222-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/wisa2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"196","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}