{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:20:27Z","timestamp":1771474827707,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031812408","type":"print"},{"value":"9783031812415","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81241-5_14","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:45:36Z","timestamp":1735652736000},"page":"197-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Effective Resistance Based Community Detection in\u00a0Complex Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5420-9959","authenticated-orcid":false,"given":"Annalisa","family":"Socievole","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7297-7126","authenticated-orcid":false,"given":"Clara","family":"Pizzuti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Aynulin, R.: Impact of network topology on efficiency of proximity measures for community detection. In: International Conference on Complex Networks and Their Applications, pp. 188\u2013197. Springer (2019)","DOI":"10.1007\/978-3-030-36687-2_16"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Barrat, A., Barthelemy, M., Pastor-Satorras, R., Vespignan, A.: The architecture of complex weighted networks. In: Proceedings of National Academy of Science, pp. 101,3747 (2004)","DOI":"10.1073\/pnas.0400087101"},{"issue":"10","key":"14_CR3","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."},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01270385","volume":"6","author":"AK Chandra","year":"1996","unstructured":"Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R., Tiwari, P.: The electrical resistance of a graph captures its commute and cover times. Comput. Complex. 6(4), 312\u2013340 (1996)","journal-title":"Comput. Complex."},{"key":"14_CR5","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9781614440222","volume-title":"Random Walks and Electric Networks","author":"PG Doyle","year":"1984","unstructured":"Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks. The Mathematical Association of America, USA (1984)"},{"issue":"12","key":"14_CR6","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"14_CR7","unstructured":"Goldberg, D.E.: Genetic algorithms in search. Optimization, and Machine Learning (1989)"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"DJ Klein","year":"1993","unstructured":"Klein, D.J., Randi\u0107, M.: Resistance distance. J. Math. Chem. 12(1), 81\u201395 (1993)","journal-title":"J. Math. Chem."},{"key":"14_CR9","unstructured":"Park, Y., Song, M.: A genetic algorithm for clustering problems. In: Proceedings of the Third Annual Conference on Genetic Programming. vol.\u00a01998, pp. 568\u2013575 (1998)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Pizzuti, C., Socievole, A.: An effective resistance based genetic algorithm for community detection. In: IJCCI, pp. 28\u201336 (2021)","DOI":"10.5220\/0010644300003063"},{"key":"14_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.046101","volume":"E83","author":"F Radicchi","year":"2011","unstructured":"Radicchi, F., Ramasco, J.J., Fortunato, S.: Information filtering in complex weighted networks. Phys. Rev. E E83, 046101 (2011)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"14_CR12","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":"14_CR13","doi-asserted-by":"crossref","unstructured":"Saerens, M., Fouss, F., Yen, L., Dupont, P.: The principal components analysis of a graph, and its relationships to spectral clustering. In: European Conference on Machine Learning, pp. 371\u2013383. Springer (2004)","DOI":"10.1007\/978-3-540-30115-8_35"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Sommer, F., Fouss, F., Saerens, M.: Comparison of graph node distances on clustering tasks. In: International Conference on Artificial Neural Networks, pp. 192\u2013201. Springer (2016)","DOI":"10.1007\/978-3-319-44778-0_23"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. Siam J. Comput. (40), 1913 (1996)","DOI":"10.1137\/080734029"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Tumminello, M., Aste, T., Matteo, T.D., , Mantegna, R.N.: A tool for filtering information in complex systems. In: Proceedings of National Academy of Science, pp. 10421\u201310426 (2005)","DOI":"10.1073\/pnas.0500298102"},{"key":"14_CR17","volume-title":"Graph Spectra for Complex Networks","author":"P Van Mieghem","year":"2011","unstructured":"Van Mieghem, P.: Graph Spectra for Complex Networks. Cambridge University Press, New York, NY, USA (2011)"},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.96.032311","volume":"96","author":"P Van Mieghem","year":"2017","unstructured":"Van Mieghem, P., Devriendt, K., Cetinay, H.: Pseudoinverse of the Laplacian and best spreader node in a network. Phys. Rev. E 96(3), 032311 (2017)","journal-title":"Phys. Rev. E"},{"key":"14_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.98.042304","volume":"E98","author":"X Yan","year":"2018","unstructured":"Yan, X., Jeub, L.G.S., Flammini, A., Radicchi, F., Fortunato, S.: Weight thresholding on complex networks. Phys. Rev. E E98, 042304 (2018)","journal-title":"Phys. Rev. E"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Yen, L., Fouss, F., Decaestecker, C., Francq, P., Saerens, M.: Graph nodes clustering based on the commute-time kernel. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 1037\u20131045. Springer (2007)","DOI":"10.1007\/978-3-540-71701-0_117"},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.datak.2008.10.006","volume":"68","author":"L Yen","year":"2009","unstructured":"Yen, L., Fouss, F., Decaestecker, C., Francq, P., Saerens, M.: Graph nodes clustering with the sigmoid commute-time kernel: a comparative study. Data Knowl. Eng. 68(3), 338\u2013361 (2009)","journal-title":"Data Knowl. Eng."}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81241-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:03:42Z","timestamp":1735653822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}