{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:57:08Z","timestamp":1726081028221},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030445836"},{"type":"electronic","value":"9783030445843"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-44584-3_17","type":"book-chapter","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T23:04:42Z","timestamp":1587510282000},"page":"210-222","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Addressing the Resolution Limit and the Field of View Limit in Community Mining"],"prefix":"10.1007","author":[{"given":"Shiva Zamani","family":"Gharaghooshi","sequence":"first","affiliation":[]},{"given":"Osmar R.","family":"Za\u00efane","sequence":"additional","affiliation":[]},{"given":"Christine","family":"Largeron","sequence":"additional","affiliation":[]},{"given":"Mohammadmahdi","family":"Zafarmand","sequence":"additional","affiliation":[]},{"given":"Chang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,22]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Adamic, L.A., Glance, N.: The political blogosphere and the 2004 U.S. election. In: Proceedings of the 3rd International Workshop on Link Discovery, pp. 36\u201343 (2005)","key":"17_CR1","DOI":"10.1145\/1134271.1134277"},{"issue":"5","key":"17_CR2","doi-asserted-by":"publisher","first-page":"053039","DOI":"10.1088\/1367-2630\/10\/5\/053039","volume":"10","author":"A Arenas","year":"2008","unstructured":"Arenas, A., Fernandez, A., Gomez, S.: Analysis of the structure of complex networks at different resolution levels. New J. Phys. 10(5), 053039 (2008)","journal-title":"New J. Phys."},{"doi-asserted-by":"crossref","unstructured":"Aynaud, T., Blondel, V.D., Guillaume, J.L., Lambiotte, R.: Multilevel Local Optimization of Modularity, pp. 315\u2013345. Wiley, Hoboken (2013)","key":"17_CR3","DOI":"10.1002\/9781118601181.ch13"},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1137\/0603056","volume":"3","author":"ER Barnes","year":"1982","unstructured":"Barnes, E.R.: An algorithm for partitioning the nodes of a graph. SIAM J. Alg. Discr. Meth. 3(4), 541\u2013550 (1982)","journal-title":"SIAM J. Alg. Discr. Meth."},{"issue":"10","key":"17_CR5","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. Theor. Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech. Theor. Exp."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"17_CR7","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1002\/sam.10133","volume":"4","author":"M Coscia","year":"2013","unstructured":"Coscia, M., Giannotti, F., Pedreschi, D.: A classification for community discovery methods in complex networks. Stat. Anal. Data Min. 4(5), 512\u2013546 (2013)","journal-title":"Stat. Anal. Data Min."},{"issue":"7","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0159161","volume":"11","author":"S Emmons","year":"2016","unstructured":"Emmons, S., Kobourov, S., Gallant, M., B\u00f6rner, K.: Analysis of network clustering algorithms and cluster quality metrics at scale. PLoS One 11(7), 1\u201318 (2016)","journal-title":"PLoS One"},{"unstructured":"EUROSIS Final Report: Webmapping of science and society actors in Europe, final report. \nwww.eurosfaire.prd.fr\/7pc\/documents\/1274371553_finalreporteurosis3_1.doc\n\n. Accessed 01 June 2018","key":"17_CR9"},{"issue":"3\u20135","key":"17_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phy. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phy. Rep."},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato, S., Barth\u00e9lemy, M.: Resolution limit in community detection. PNAS 104(1), 36\u201341 (2007)","journal-title":"PNAS"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato, S., Hric, D.: Community detection in networks: a user guide. Phys. Rep. 659, 1\u201344 (2016)","journal-title":"Phys. Rep."},{"issue":"12","key":"17_CR13","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.J.: Community structure in social and biological networks. PNAS 99(12), 7821\u20137826 (2002)","journal-title":"PNAS"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985)","journal-title":"J. Classif."},{"issue":"5","key":"17_CR15","doi-asserted-by":"publisher","first-page":"S48","DOI":"10.1137\/13090729X","volume":"36","author":"TG Kolda","year":"2014","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T.D., Seshadhri, C., Task, C.: Counting triangles in massive graphs with MapReduce. SIAM J. Sci. Comput. 36(5), S48\u2013S77 (2014)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 1\u20135 (2008)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"36109","DOI":"10.1103\/PhysRevE.77.036109","volume":"77","author":"Z Li","year":"2008","unstructured":"Li, Z., Zhang, S., Wang, R.S., Zhang, X.S., Chen, L.: Quantitative function for community detection. Phys. Rev. E 77(3), 36109 (2008)","journal-title":"Phys. Rev. E"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M Newman","year":"2004","unstructured":"Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Newman, M.: Fast algorithm for detecting community structure in networks. Phys. Rev. E - Stat. Nonlinear Soft Matter Phys. 69, 066133 (2004)","key":"17_CR19","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11569596_31","volume-title":"Computer and Information Sciences - ISCIS 2005","author":"P Pons","year":"2005","unstructured":"Pons, P., Latapy, M.: Computing communities in large networks using random walks. In: Yolum, I., G\u00fcng\u00f6r, T., G\u00fcrgen, F., \u00d6zturan, C. (eds.) ISCIS 2005. LNCS, vol. 3733, pp. 284\u2013293. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11569596_31"},{"issue":"9","key":"17_CR21","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F Radicchi","year":"2004","unstructured":"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. PNAS 101(9), 2658\u201363 (2004)","journal-title":"PNAS"},{"doi-asserted-by":"crossref","unstructured":"Raghavan, N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E - Stat. Nonlinear Soft Matter Phys. 76, 036106 (2007)","key":"17_CR22","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"16110","DOI":"10.1103\/PhysRevE.74.016110","volume":"74","author":"J Reichardt","year":"2006","unstructured":"Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Phys. Rev. E 74, 16110 (2006)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"17_CR24","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall, M., Bergstrom, C.: Maps of random walks on complex network reveal community structure. PNAS 105(4), 1118\u20131123 (2008)","journal-title":"PNAS"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"e32210","DOI":"10.1371\/journal.pone.0032210","volume":"7","author":"MT Schaub","year":"2012","unstructured":"Schaub, M.T., Delvenne, J.C., Yaliraki, S.N., Barahona, M.: Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit. PLoS One 7, e32210 (2012)","journal-title":"PLoS One"},{"key":"17_CR26","first-page":"583","volume":"3","author":"A Strehl","year":"2003","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles \u2013 a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583\u2013617 (2003)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"17_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"6684","key":"17_CR28","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"30750","DOI":"10.1038\/srep30750","volume":"6","author":"Z Yang","year":"2016","unstructured":"Yang, Z., Algesheimer, R., Tessone, C.J.: A comparative analysis of community detection algorithms on artificial networks. Sci. Rep. 6, 30750 (2016)","journal-title":"Sci. Rep."},{"key":"17_CR30","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"W Zachary","year":"1977","unstructured":"Zachary, W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452\u2013473 (1977)","journal-title":"J. Anthropol. Res."}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XVIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44584-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T23:08:04Z","timestamp":1587510484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44584-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030445836","9783030445843"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44584-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent Data Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Konstanz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2020","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":"ida2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ida2020.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"114","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":"45","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":"0","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":"39% - 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,5","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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}