{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:55:56Z","timestamp":1774022156944,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"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":["Computing"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s00607-023-01223-4","type":"journal-article","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T18:02:10Z","timestamp":1695405730000},"page":"353-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["PERMDEC: community deception in weighted networks using permanence"],"prefix":"10.1007","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3740-8312","authenticated-orcid":false,"given":"Kalaichelvi","family":"Nallusamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. S.","family":"Easwarakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"key":"1223_CR1","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:P10008","journal-title":"J Stat Mech Theory Exp"},{"issue":"2","key":"1223_CR2","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2007","unstructured":"Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z, Wagner D (2007) On modularity clustering. IEEE Trans Knowl Data Eng 20(2):172\u2013188","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1223_CR3","doi-asserted-by":"publisher","unstructured":"Chakraborty T, Srinivasan S, Ganguly N, Mukherjee A, Bhowmick S (2014) On the permanence of vertices in network communities. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, association for computing machinery, New York, NY, USA, KDD vol 14, pp 1396\u20131405, https:\/\/doi.org\/10.1145\/2623330.2623707","DOI":"10.1145\/2623330.2623707"},{"key":"1223_CR4","unstructured":"Chakraborty T, Srinivasan S, Ganguly N, Mukherjee A, Bhowmick S (2016) Permanence and community structure in complex networks. CoRR abs\/1606.01543, http:\/\/arxiv.org\/abs\/1606.01543, 1606.01543"},{"issue":"3","key":"1223_CR5","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TCSS.2021.3054115","volume":"8","author":"X Chen","year":"2021","unstructured":"Chen X, Jiang Z, Li H, Ma J, Yu PS (2021) Community hiding by link perturbation in social networks. IEEE Trans Comput Soc Syst 8(3):704\u2013715. https:\/\/doi.org\/10.1109\/TCSS.2021.3054115","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"1223_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s00607-021-00966-2","volume":"104","author":"JH Chin","year":"2022","unstructured":"Chin JH, Ratnavelu K (2022) Community detection using constrained label propagation algorithm with nodes exemption. Computing 104:339\u2013358. https:\/\/doi.org\/10.1007\/s00607-021-00966-2","journal-title":"Computing"},{"key":"1223_CR7","doi-asserted-by":"publisher","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/p09008","volume":"09","author":"L Danon","year":"2005","unstructured":"Danon L, D\u00edaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech Theory Exp 09:P09008\u2013P09008. https:\/\/doi.org\/10.1088\/1742-5468\/2005\/09\/p09008","journal-title":"J Stat Mech Theory Exp"},{"key":"1223_CR8","doi-asserted-by":"publisher","unstructured":"El-moussaoui M, Agouti T, Tikniouine A, Adnani ME (2019) A comprehensive literature review on community detection: approaches and applications. Procedia Computer Science vol 151, pp 295\u2013302, the 10th international conference on ambient systems, networks and technologies (ANT 2019) \/ The 2nd international conference on emerging data and industry 4.0 (EDI40 2019) \/ Affiliated workshops https:\/\/doi.org\/10.1016\/j.procs.2019.04.042, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050919305046","DOI":"10.1016\/j.procs.2019.04.042"},{"key":"1223_CR9","unstructured":"Fionda V, Pirr\u00f2 G (2016) From community detection to community deception. CoRR abs\/1609.00149, http:\/\/arxiv.org\/abs\/1609.00149, 1609.00149"},{"key":"1223_CR10","doi-asserted-by":"publisher","unstructured":"Fionda V, Pirr\u00f3 G (2021) Community deception in weighted networks. In: Proceedings of the 2021 IEEE\/ACM international conference on advances in social networks analysis and mining, association for computing machinery, New York, NY, USA, ASONAM vol 21, pp 278\u2013282, https:\/\/doi.org\/10.1145\/3487351.3488337","DOI":"10.1145\/3487351.3488337"},{"key":"1223_CR11","doi-asserted-by":"crossref","unstructured":"Fionda V, Pirr\u00f3 G, (2022) Community deception in networks: where we are and where we should go. Complex networks & their applications x complex networks, (2021) Studies in computational intelligence, vol 1016. Springer, Cham","DOI":"10.1007\/978-3-030-93413-2_13"},{"issue":"4","key":"1223_CR12","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TKDE.2017.2776133","volume":"30","author":"V Fionda","year":"2018","unstructured":"Fionda V, Pirr\u00f3 G (2018) Community deception or: how to stop fearing community detection algorithms. IEEE Trans Knowl Data Eng 30(4):660\u2013673. https:\/\/doi.org\/10.1109\/TKDE.2017.2776133","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1223_CR13","unstructured":"Liu Y, Liu J, Zhang Z, Zhu L, Li A (2019) Rem: from structural entropy to community structure deception. In: Advances in neural information processing systems, Curran Associates, Inc., Brooklyn, vol\u00a032"},{"issue":"4","key":"1223_CR14","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/TCSS.2021.3062711","volume":"8","author":"S Mittal","year":"2021","unstructured":"Mittal S, Sengupta D, Chakraborty T (2021) Hide and seek: outwitting community detection algorithms. IEEE Trans Comput Soc Syst 8(4):799\u2013808. https:\/\/doi.org\/10.1109\/TCSS.2021.3062711","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"1223_CR15","doi-asserted-by":"publisher","unstructured":"Nagaraja S (2010) The impact of unlinkability on adversarial community detection: effects and countermeasures. In: Privacy enhancing technologies. PETS 2010. Lecture notes in computer science, vol 6205, pp 253\u2013272, https:\/\/doi.org\/10.1007\/978-3-642-14527-8_15","DOI":"10.1007\/978-3-642-14527-8_15"},{"key":"1223_CR16","doi-asserted-by":"publisher","unstructured":"Nallusamy K, Easwarakumar KS (2022) CGRAM: enhanced algorithm for community detection in social networks. Intell Autom Soft Comput 31(2):749\u2013765, https:\/\/doi.org\/10.32604\/iasc.2022.020189, http:\/\/www.techscience.com\/iasc\/v31n2\/44541","DOI":"10.32604\/iasc.2022.020189"},{"issue":"6","key":"1223_CR17","doi-asserted-by":"publisher","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066133","journal-title":"Phys Rev E"},{"issue":"3","key":"1223_CR18","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104","journal-title":"Phys Rev E"},{"key":"1223_CR19","doi-asserted-by":"publisher","unstructured":"Newman MEJ (2006b) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582, https:\/\/doi.org\/10.1073\/pnas.0601602103, https:\/\/www.pnas.org\/content\/103\/23\/8577.full.pdf","DOI":"10.1073\/pnas.0601602103"},{"key":"1223_CR20","doi-asserted-by":"publisher","first-page":"065103","DOI":"10.1103\/PhysRevE.71.065103","volume":"71","author":"JP Onnela","year":"2005","unstructured":"Onnela JP, Saram\u00e4ki J, Kert\u00e9sz J, Kaski K (2005) Intensity and coherence of motifs in weighted complex networks. Phys Rev E 71:065103. https:\/\/doi.org\/10.1103\/PhysRevE.71.065103","journal-title":"Phys Rev E"},{"key":"1223_CR21","doi-asserted-by":"crossref","unstructured":"Pons P, Latapy M (2005) Computing communities in large networks using random walks. In: Computer and information sciences-ISCIS 2005: 20th international symposium, Istanbul, Turkey, October 26-28, 2005. Proceedings 20, Springer, pp 284\u2013293","DOI":"10.1007\/11569596_31"},{"issue":"3","key":"1223_CR22","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036106","journal-title":"Phys Rev E"},{"issue":"1","key":"1223_CR23","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall M, Axelsson D, Bergstrom CT (2009) The map equation. Eur Phys J Special Topics 178(1):13\u201323","journal-title":"Eur Phys J Special Topics"},{"key":"1223_CR24","doi-asserted-by":"publisher","first-page":"027105","DOI":"10.1103\/PhysRevE.75.027105","volume":"75","author":"J Saram\u00e4ki","year":"2007","unstructured":"Saram\u00e4ki J, Kivel\u00e4 M, Onnela JP, Kaski K, Kert\u00e9sz J (2007) Generalizations of the clustering coefficient to weighted complex networks. Phys Rev E 75:027105. https:\/\/doi.org\/10.1103\/PhysRevE.75.027105","journal-title":"Phys Rev E"},{"key":"1223_CR25","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1007\/s00607-019-00787-4","volume":"102","author":"M Shirjini","year":"2020","unstructured":"Shirjini M, Farzi S, Nikanjam A (2020) MDPcluster: a swarm-based community detection algorithm in large-scale graphs. Computing 102:893\u2013922. https:\/\/doi.org\/10.1007\/s00607-019-00787-4","journal-title":"Computing"},{"key":"1223_CR26","unstructured":"Waniek M, Michalak TP, Rahwan T, Wooldridge MJ (2016) Hiding individuals and communities in a social network. CoRR abs\/1608.00375, http:\/\/arxiv.org\/abs\/1608.00375"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01223-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-023-01223-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01223-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T07:08:37Z","timestamp":1706598517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-023-01223-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,22]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1223"],"URL":"https:\/\/doi.org\/10.1007\/s00607-023-01223-4","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,22]]},"assertion":[{"value":"23 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}