{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:52:21Z","timestamp":1742921541485,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030026974"},{"type":"electronic","value":"9783030026981"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02698-1_10","type":"book-chapter","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T16:46:59Z","timestamp":1541695619000},"page":"111-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding Overlapping Communities by Increasing the Determinacy of SLPA in Complex Networks"],"prefix":"10.1007","author":[{"given":"Jingyi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhixin","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qijuan","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengjia","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,9]]},"reference":[{"issue":"11","key":"10_CR1","first-page":"2540","volume":"39","author":"J Di","year":"2011","unstructured":"Di, J., Dayou, L., Bo, Y., et al.: Fast and complex networks clustering algorithm based on local probing. J. Electron. 39(11), 2540\u20132546 (2011)","journal-title":"J. Electron."},{"issue":"12","key":"10_CR2","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. Proc. National Acad. Sci. U.S. Am. 99(12), 7821 (2002)","journal-title":"Proc. National Acad. Sci. U.S. Am."},{"issue":"7043","key":"10_CR3","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., et al.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814 (2005)","journal-title":"Nature"},{"issue":"2","key":"10_CR4","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":"23","key":"10_CR5","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czech. Math. J. 23(23), 298\u2013305 (1973)","journal-title":"Czech. Math. J."},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 69(6 Pt 2) (2004). https:\/\/doi.org\/10.1103\/PhysRevE.69.066133","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"10_CR7","unstructured":"Van Dongen, S.M.: Graph clustering by flow simulation. Open Access (2000)"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"033015","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":"10","key":"10_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., et al.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), 155\u2013168 (2008)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Raghavan, U.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(3 Pt 2) (2007). https:\/\/doi.org\/10.1103\/PhysRevE.76.036106","DOI":"10.1103\/PhysRevE.76.036106"},{"issue":"10","key":"10_CR11","doi-asserted-by":"publisher","first-page":"2011","DOI":"10.1088\/1367-2630\/12\/10\/103018","volume":"12","author":"S Gregory","year":"2010","unstructured":"Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 2011\u20132024 (2010)","journal-title":"New J. Phys."},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/s11390-012-1236-x","volume":"27","author":"ZH Wu","year":"2012","unstructured":"Wu, Z.H., Lin, Y.F., Gregory, S., et al.: Balanced multi-label propagation for overlapping community detection in social networks. J. Comput. Sci. Technol. 27(3), 468\u2013479 (2012)","journal-title":"J. Comput. Sci. Technol."},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-30220-6_3","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J Xie","year":"2012","unstructured":"Xie, J., Szymanski, B.K.: Towards linear time overlapping community detection in social networks. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012. LNCS (LNAI), vol. 7302, pp. 25\u201336. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30220-6_3"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Wang, T., Qian, X., Wang, X.: HLPA: a hybrid label propagation algorithm to find communities in large-scale networks. In: IEEE International Conference on Awareness Science and Technology, pp. 135\u2013140. IEEE (2015)","DOI":"10.1109\/ICAwST.2015.7314035"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Liu, W., Jiang, X., Pellegrini, M., et al.: Discovering communities in complex networks by edge label propagation. Sci. Rep. 6 (2016). Article number: 22470","DOI":"10.1038\/srep22470"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Hou, C.J., Ratnavelu, K.: A semi-synchronous label propagation algorithm with constraints for community detection in complex networks. Sci. Rep. 7 (2017). Article number: 45836","DOI":"10.1038\/srep45836"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2) (2004). https:\/\/doi.org\/10.1103\/physreve.69.026113","DOI":"10.1103\/physreve.69.026113"},{"issue":"8","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","volume":"388","author":"H Shen","year":"2009","unstructured":"Shen, H., Cheng, X., Cai, K., et al.: Detect overlapping and hierarchical community structure in networks. Physica A: Stat. Mech. Appl. 388(8), 1706\u20131712 (2009)","journal-title":"Physica A: Stat. Mech. Appl."},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 78(2) (2008). https:\/\/doi.org\/10.1103\/physreve.78.046110","DOI":"10.1103\/physreve.78.046110"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452\u2013473 (1977)","journal-title":"J. Anthropol. Res."},{"issue":"4","key":"10_CR21","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau, D., Schneider, K., Boisseau, O.J., et al.: The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396\u2013405 (2003)","journal-title":"Behav. Ecol. Sociobiol."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Newman, M.E.: Modularity and community structure in networks. In: APS March Meeting. pp. 8577\u20138582. American Physical Society (2006)","DOI":"10.1073\/pnas.0601602103"}],"container-title":["Lecture Notes in Computer Science","Intelligence Science and Big Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02698-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:42:07Z","timestamp":1710243727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-02698-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030026974","9783030026981"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02698-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IScIDE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Science and Big Data Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lanzhou","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iscide2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iscide.lzu.edu.cn\/","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":"121","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":"59","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":"49% - 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":"2.7","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":"4.9","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)"}}]}}