{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:54:26Z","timestamp":1743000866222,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819996391"},{"type":"electronic","value":"9789819996407"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-99-9640-7_20","type":"book-chapter","created":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T15:02:38Z","timestamp":1704380558000},"page":"276-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Community Detection Based on\u00a0Integration of\u00a0Non-cooperative and\u00a0Cooperative Game"],"prefix":"10.1007","author":[{"given":"Ling","family":"Wu","sequence":"first","affiliation":[]},{"given":"Mao","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Kun","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"issue":"9","key":"20_CR1","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1109\/TKDE.2016.2563425","volume":"28","author":"H-J Li","year":"2016","unstructured":"Li, H.-J., Bu, Z., Li, A., Liu, Z., Shi, Y.: Fast and accurate mining the community structure: integrating center locating and membership optimization. IEEE Trans. Knowl. Data Eng. 28(9), 2349\u20132362 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Hu, K., et al.: Predicting disease-related genes by path structure and community structure in protein-protein networks. J. Stat. Mech.: Theory Exp. 2018(10), 100001 (2018)","DOI":"10.1088\/1742-5468\/aae02b"},{"issue":"12","key":"20_CR3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.128702","volume":"109","author":"AV Goltsev","year":"2012","unstructured":"Goltsev, A.V., Dorogovtsev, S.N., Oliveira, J.G., Mendes, J.F.: Localization and spreading of diseases in complex networks. Phys. Rev. Lett. 109(12), 128702 (2012)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.91.012801","volume":"91","author":"H-J Li","year":"2015","unstructured":"Li, H.-J., Daniels, J.J.: Social significance of community structure: statistical view. Phys. Rev. E 91(1), 012801 (2015)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1109\/TCYB.2017.2696998","volume":"48","author":"Q Xuan","year":"2017","unstructured":"Xuan, Q., Zhang, Z.-Y., Fu, C., Hu, H.-X., Filkov, V.: Social synchrony on complex networks. IEEE Trans. Cybernet. 48(5), 1420\u20131431 (2017)","journal-title":"IEEE Trans. Cybernet."},{"issue":"5","key":"20_CR6","first-page":"1715","volume":"45","author":"P Chong","year":"2014","unstructured":"Chong, P., Shuai, B.: Measure of hazardous materials transportation network invulnerability based on complex network. J. Central South Univ. 45(5), 1715\u20131723 (2014)","journal-title":"J. Central South Univ."},{"key":"20_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106670","volume":"214","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Cao, J., Bu, Z., Jiang, J., Chen, H.: Proximity-based group formation game model for community detection in social network. Knowl.-Based Syst. 214, 106670 (2021)","journal-title":"Knowl.-Based Syst."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s10618-010-0186-6","volume":"21","author":"W Chen","year":"2010","unstructured":"Chen, W., Liu, Z., Sun, X., Wang, Y.: A game-theoretic framework to identify overlapping communities in social networks. Data Min. Knowl. Disc. 21, 224\u2013240 (2010)","journal-title":"Data Min. Knowl. Disc."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Torkaman, A., Badie, K., Salajegheh, A., Bokaei, M.H., Ardestani, S.F.F.: A four-stage algorithm for community detection based on label propagation and game theory in social networks. AI 4(1), 255\u2013269 (2023)","DOI":"10.3390\/ai4010011"},{"issue":"3","key":"20_CR10","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":"20_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"JF Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium points in n-person games. Proc. Natl. Acad. Sci. 36(1), 48\u201349 (1950)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/11\/3\/033015","volume":"11","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S., Kert\u00e9sz, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)","journal-title":"New J. Phys."},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)","journal-title":"Phys. Rev. E"},{"issue":"10","key":"20_CR14","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech: Theory Exp."},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Pons, P., Latapy, M.: Computing communities in large networks using random walks. In: Yolum, P., et al. (eds.) Computer and Information Sciences - ISCIS 2005. LNCS, vol. 3733, pp. 284\u2013293. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11569596_31","DOI":"10.1007\/11569596_31"},{"issue":"4","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105(4), 1118\u20131123 (2008)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Sun, Z., et al.: Community detection based on the matthew effect. Knowl.-Based Syst. 205, 106256 (2020)","DOI":"10.1016\/j.knosys.2020.106256"},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s13278-018-0543-9","volume":"8","author":"R Arava","year":"2018","unstructured":"Arava, R.: Community detection using coordination games. Soc. Netw. Anal. Min. 8(1), 65 (2018)","journal-title":"Soc. Netw. Anal. Min."},{"key":"20_CR19","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles\u2013a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583\u2013617 (2002)"},{"issue":"336","key":"20_CR20","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846\u2013850 (1971)","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Communications in Computer and Information Science","Computer Supported Cooperative Work and Social Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-9640-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T15:17:15Z","timestamp":1704381435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-9640-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819996391","9789819996407"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-9640-7_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ChineseCSCW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"CCF Conference on Computer Supported Cooperative Work  and Social Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Harbin","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":"18 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"chinesecscw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.scholat.com\/ccscw\/2023","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":"Yes. Microsoft CMT.","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"221","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":"54","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":"28","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":"24% - 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)"}}]}}