{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:42:27Z","timestamp":1743082947323,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031344992"},{"type":"electronic","value":"9783031345005"}],"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-3-031-34500-5_3","type":"book-chapter","created":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T06:01:58Z","timestamp":1685253718000},"page":"27-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["BVNS for\u00a0Overlapping Community Detection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1915-4160","authenticated-orcid":false,"given":"Sergio","family":"P\u00e9rez-Pel\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1702-4941","authenticated-orcid":false,"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1558-9239","authenticated-orcid":false,"given":"Antonio","family":"Gonz\u00e1lez-Pardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3124","authenticated-orcid":false,"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.inffus.2020.05.009","volume":"63","author":"D Camacho","year":"2020","unstructured":"Camacho, D., Panizo-LLedot, A., Bello-Orgaz, G., Gonzalez-Pardo, A., Cambria, E.: The four dimensions of social network analysis: an overview of research methods, applications, and software tools. Inf. Fusion 63, 88\u2013120 (2020)","journal-title":"Inf. Fusion"},{"issue":"11","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.3390\/electronics10111232","volume":"10","author":"P Casas-Mart\u00ednez","year":"2021","unstructured":"Casas-Mart\u00ednez, P., Casado-Ceballos, A., S\u00e1nchez-Oro, J., Pardo, E.G.: Multi-objective grasp for maximizing diversity. Electronics 10(11), 1232 (2021)","journal-title":"Electronics"},{"issue":"12","key":"3_CR3","doi-asserted-by":"publisher","first-page":"3247","DOI":"10.1016\/j.cor.2012.04.017","volume":"39","author":"A Duarte","year":"2012","unstructured":"Duarte, A., Escudero, L.F., Mart\u00ed, R., Mladenovic, N., Pantrigo, J.J., S\u00e1nchez-Oro, J.: Variable neighborhood search for the vertex separation problem. Comput. Oper. Res. 39(12), 3247\u20133255 (2012)","journal-title":"Comput. Oper. Res."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Duarte, A., S\u00e1nchez-Oro, J., Mladenovi\u0107, N., Todosijevi\u0107, R.: Variable neighborhood descent. Handbook of Heuristics, pp. 341\u2013367 (2018)","DOI":"10.1007\/978-3-319-07124-4_9"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"3_CR6","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA Feo","year":"1994","unstructured":"Feo, T.A., Resende, M.G.C., Smith, S.H.: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Operations Research 42(5), 860\u2013878 (1994)","journal-title":"Operations Research"},{"key":"3_CR7","unstructured":"Fernandez, M., Gonzalez-Pardo, A., Alani, H.: Radicalisation influence in social media. J. Web Sci. 6 (2019)"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1023\/A:1015013919497","volume":"8","author":"F Garc\u00eda-L\u00f3pez","year":"2002","unstructured":"Garc\u00eda-L\u00f3pez, F., Meli\u00e1n-Batista, B., Moreno-P\u00e9rez, J.A., Moreno-Vega, J.M.: The parallel variable neighborhood search for the p-median problem. J. Heuristics 8(3), 375\u2013388 (2002)","journal-title":"J. Heuristics"},{"issue":"10","key":"3_CR9","doi-asserted-by":"publisher","first-page":"103018","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), 103018 (2010)","journal-title":"New J. Phys."},{"key":"3_CR10","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-91086-4_3","volume-title":"Handbook of Metaheuristics","author":"P Hansen","year":"2019","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., P\u00e9rez, J.A.M.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 57\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_3"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N., Perez-Britos, D.: Variable neighborhood decomposition search. J. Heuristics 7(4), 335\u2013350 (2001). https:\/\/doi.org\/10.1023\/A:1011336210885","journal-title":"J. Heuristics"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.INS.2018.09.063","volume":"476","author":"A Herr\u00e1n","year":"2019","unstructured":"Herr\u00e1n, A., Colmenar, M.J., Duarte, A.: A variable neighborhood search approach for the vertex bisection problem. Inf. Sci. 476, 1\u201318 (2019). https:\/\/doi.org\/10.1016\/J.INS.2018.09.063","journal-title":"Inf. Sci."},{"key":"3_CR13","unstructured":"Jaki, S., Smedt, T.D.: Right-wing german hate speech on twitter: Analysis and automatic detection. CoRR arXiv:abs\/1910.07518 (2019)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"026109","DOI":"10.1103\/PhysRevE.78.026109","volume":"78","author":"JM Kumpula","year":"2008","unstructured":"Kumpula, J.M., Kivel\u00e4, M., Kaski, K., Saram\u00e4ki, J.: Sequential algorithm for fast clique percolation. Phys. Rev. E 78, 026109 (2008)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"18001","DOI":"10.1209\/0295-5075\/90\/18001","volume":"90","author":"A L\u00e1z\u00e1r","year":"2010","unstructured":"L\u00e1z\u00e1r, A., Abel, D., Vicsek, T.: Modularity measure of networks with overlapping communities. EPL (Europhysics Letters) 90(1), 18001 (2010)","journal-title":"EPL (Europhysics Letters)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"116899","DOI":"10.1016\/j.eswa.2022.116899","volume":"200","author":"I Lozano-Osorio","year":"2022","unstructured":"Lozano-Osorio, I., Mart\u00ednez-Gavara, A., Mart\u00ed, R., Duarte, A.: Max-min dispersion with capacity and cost for a practical location problem. Expert Syst. Appl. 200, 116899 (2022)","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"3_CR17","doi-asserted-by":"publisher","first-page":"3136","DOI":"10.1109\/TFUZZ.2018.2812148","volume":"26","author":"W Luo","year":"2018","unstructured":"Luo, W., Zhang, D., Jiang, H., Ni, L., Hu, Y.: Local community detection with the dynamic membership function. IEEE Trans. Fuzzy Syst. 26(5), 3136\u20133150 (2018)","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.ins.2021.11.048","volume":"585","author":"R Martin-Santamaria","year":"2022","unstructured":"Martin-Santamaria, R., S\u00e1nchez-Oro, J., P\u00e9rez-Pel\u00f3, S., Duarte, A.: Strategic oscillation for the balanced minimum sum-of-squares clustering problem. Inf. Sci. 585, 529\u2013542 (2022)","journal-title":"Inf. Sci."},{"issue":"23","key":"3_CR19","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. of Sci. 103(23), 8577\u20138582 (2006)","journal-title":"Proc. Natl. Acad. of Sci."},{"key":"3_CR20","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Info Lab (1999)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-030-15843-9_12","volume-title":"Variable Neighborhood Search","author":"S P\u00e9rez-Pel\u00f3","year":"2019","unstructured":"P\u00e9rez-Pel\u00f3, S., S\u00e1nchez-Oro, J., Duarte, A.: Detecting weak points in networks using variable neighborhood search. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds.) ICVNS 2018. LNCS, vol. 11328, pp. 141\u2013151. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-15843-9_12"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"107838","DOI":"10.1016\/j.asoc.2021.107838","volume":"112","author":"S P\u00e9rez-Pel\u00f3","year":"2021","unstructured":"P\u00e9rez-Pel\u00f3, S., S\u00e1nchez-Oro, J., Gonzalez-Pardo, A., Duarte, A.: A fast variable neighborhood search approach for multi-objective community detection. Appl. Soft Comput. 112, 107838 (2021)","journal-title":"Appl. Soft Comput."},{"issue":"6191","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez, A., Laio, A.: Clustering by fast search and find of density peaks. Science 344(6191), 1492\u20131496 (2014). https:\/\/doi.org\/10.1126\/science.1242072","journal-title":"Science"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"S\u00e1nchez-Oro, J., Mart\u00ednez-Gavara, A., Laguna, M., Duarte, A., Mart\u00ed, R.: Variable neighborhood descent for the incremental graph drawing. Electron. Notes Discrete Math. 58, 183\u2013190 (2017). https:\/\/doi.org\/10.1016\/j.endm.2017.03.024, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1571065317300604. 4th International Conference on Variable Neighborhood Search","DOI":"10.1016\/j.endm.2017.03.024"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"S\u00e1nchez-Oro, J., L\u00f3pez-S\u00e1nchez, A.D., Colmenar, M.J.: A general variable neighborhood search for solving the multi-objective open vehicle routing problem. J. Heuristics 1\u201330 (2017). https:\/\/doi.org\/10.1007\/s10732-017-9363-8","DOI":"10.1007\/s10732-017-9363-8"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.indmarman.2016.07.006","volume":"62","author":"K Swani","year":"2017","unstructured":"Swani, K., Milne, G.R., Brown, B.P., Assaf, A.G., Donthu, N.: What messages to post? evaluating the popularity of social media communications in business versus consumer markets. Ind. Mark. Manag. 62, 77\u201387 (2017)","journal-title":"Ind. Mark. Manag."},{"issue":"5","key":"3_CR27","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1109\/TKDE.2016.2518687","volume":"28","author":"JJ Whang","year":"2016","unstructured":"Whang, J.J., Gleich, D.F., Dhillon, I.S.: Overlapping community detection using neighborhood-inflated seed expansion. IEEE Trans. Knowl. Data Eng. 28(5), 1272\u20131284 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput. Surv. 45(4) (2013). https:\/\/doi.org\/10.1145\/2501654.2501657","DOI":"10.1145\/2501654.2501657"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.neucom.2019.01.074","volume":"337","author":"M Xu","year":"2019","unstructured":"Xu, M., Li, Y., Li, R., Zou, F., Gu, X.: EADP: an extended adaptive density peaks clustering for overlapping community detection in social networks. Neurocomputing 337, 287\u2013302 (2019)","journal-title":"Neurocomputing"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, p. 587\u2013596 (2013)","DOI":"10.1145\/2433396.2433471"}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34500-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T06:02:22Z","timestamp":1685253742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34500-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031344992","9783031345005"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34500-5_3","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":"29 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icvns2022.info\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","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":"11","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":"38% - 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":"3","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)"}}]}}