{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:47:45Z","timestamp":1757314065087,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T00:00:00Z","timestamp":1706486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T00:00:00Z","timestamp":1706486400000},"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,3]]},"DOI":"10.1007\/s00607-023-01249-8","type":"journal-article","created":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T17:03:26Z","timestamp":1706547806000},"page":"961-979","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Community detection of weighted complex networks via transitive closure"],"prefix":"10.1007","volume":"106","author":[{"given":"Ahmadi","family":"Hasan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2657-2843","authenticated-orcid":false,"given":"Ahmad","family":"Kamal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,29]]},"reference":[{"key":"1249_CR1","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.physa.2018.02.212","volume":"503","author":"FD Zarandi","year":"2018","unstructured":"Zarandi FD, Rafsanjani MK (2018) Community detection in complex networks using structural similarity. Phys A: Stat Mech Appl 503:882\u2013891","journal-title":"Phys A: Stat Mech Appl"},{"issue":"9","key":"1249_CR2","doi-asserted-by":"publisher","first-page":"3473","DOI":"10.1109\/TFUZZ.2021.3117442","volume":"30","author":"L Hu","year":"2021","unstructured":"Hu L, Pan X, Tang Z, Luo X (2021) A fast fuzzy clustering algorithm for complex networks via a generalized momentum method. IEEE Trans Fuzzy Syst 30(9):3473\u20133485","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"3","key":"1249_CR3","first-page":"11","volume":"6","author":"S Cheng","year":"2022","unstructured":"Cheng S, Giesen J, Huang T, Lucas P, Mueller K (2022) Identifying the skeptics and the undecided through visual cluster analysis of local network geometry. Vis Infor 6(3):11\u201322","journal-title":"Vis Infor"},{"key":"1249_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107295","volume":"228","author":"C Wu","year":"2021","unstructured":"Wu C, Peng Q, Lee J, Leibnitz K, Xia Y (2021) Effective hierarchical clustering based on structural similarities in nearest neighbor graphs. Knowl-Based Syst 228:107295","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"1249_CR5","first-page":"7309","volume":"5","author":"SK Uppada","year":"2014","unstructured":"Uppada SK (2014) Centroid based clustering algorithms-a clarion study. Int J Comput Sci Inform Technol 5(6):7309\u20137313","journal-title":"Int J Comput Sci Inform Technol"},{"issue":"2","key":"1249_CR6","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/s00357-018-9296-4","volume":"37","author":"M Rezaei","year":"2020","unstructured":"Rezaei M (2020) Improving a centroid-based clustering by using suitable centroids from another clustering. J Classif 37(2):352\u2013365","journal-title":"J Classif"},{"issue":"1","key":"1249_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-019-9059-3","volume":"15","author":"P Bhattacharjee","year":"2021","unstructured":"Bhattacharjee P, Mitra P (2021) A survey of density based clustering algorithms. Front Comput Sci 15(1):1\u201327","journal-title":"Front Comput Sci"},{"issue":"4","key":"1249_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416","journal-title":"Stat Comput"},{"issue":"2","key":"1249_CR9","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/s10586-021-03430-0","volume":"25","author":"K Berahmand","year":"2022","unstructured":"Berahmand K, Mohammadi M, Faroughi A, Mohammadiani RP (2022) A novel method of spectral clustering in attributed networks by constructing parameter-free affinity matrix. Clust Comput 25(2):869\u2013888","journal-title":"Clust Comput"},{"issue":"3","key":"1249_CR10","doi-asserted-by":"publisher","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"},{"key":"1249_CR11","unstructured":"J. B. MacQueen (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, vol 1(14), pp 281\u2013297"},{"issue":"9","key":"1249_CR12","doi-asserted-by":"publisher","first-page":"2182","DOI":"10.1016\/j.physa.2012.12.013","volume":"392","author":"Y Jiang","year":"2013","unstructured":"Jiang Y, Jia C, Yu J (2013) An efficient community detection method based on rank centrality. Phys A: Stat Mech Appl 392(9):2182\u20132194","journal-title":"Phys A: Stat Mech Appl"},{"key":"1249_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.physa.2015.06.043","volume":"438","author":"Y Li","year":"2015","unstructured":"Li Y, Jia C, Yu J (2015) A parameter-free community detection method based on centrality and dispersion of nodes in complex networks. Phys A: Stat Mech Appl 438:321\u2013334","journal-title":"Phys A: Stat Mech Appl"},{"key":"1249_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.physa.2015.05.101","volume":"437","author":"T Wang","year":"2015","unstructured":"Wang T, Wang H, Wang X (2015) A novel cosine distance for detecting communities in complex networks. Phys A: Stat Mech Appl 437:21\u201335","journal-title":"Phys A: Stat Mech Appl"},{"issue":"1","key":"1249_CR15","first-page":"805","volume":"5","author":"SK Popat","year":"2014","unstructured":"Popat SK, Emmanuel M (2014) Review and comparative study of clustering techniques.Int J Comput Sci Inform Technol 5(1):805\u2013812","journal-title":"Int J Comput Sci Inform Technol"},{"issue":"1","key":"1249_CR16","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","volume":"40","author":"ME Celebi","year":"2013","unstructured":"Celebi ME, Kingravi HA, Vela PA (2013) A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst Appl 40(1):200\u2013210","journal-title":"Expert Syst Appl"},{"key":"1249_CR17","unstructured":"Vassilvitskii S and \u00a0Arthur D (2006) k-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp\u00a01027\u20131035"},{"issue":"12","key":"1249_CR18","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci  99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"key":"1249_CR19","doi-asserted-by":"crossref","unstructured":"Dilmaghani S,  Brust MR, Danoy G, and Bouvry P  (2021) Community detection in complex networks: a survey on local approaches. In: Asian Conference on Intelligent Information and Database Systems, Springer, pp\u00a0757\u2013767","DOI":"10.1007\/978-3-030-73280-6_60"},{"issue":"6","key":"1249_CR20","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1016\/j.ins.2010.11.022","volume":"181","author":"PG Sun","year":"2011","unstructured":"Sun PG, Gao L, Han SS (2011) Identification of overlapping and non-overlapping community structure by fuzzy clustering in complex networks. Inform Sci 181(6):1060\u20131071","journal-title":"Inform Sci"},{"key":"1249_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.asoc.2013.11.020","volume":"16","author":"S Zeng","year":"2014","unstructured":"Zeng S, Tong X, Sang N (2014) Study on multi-center fuzzy c-means algorithm based on transitive closure and spectral clustering. Appl Soft Comput 16:89\u2013101","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1249_CR22","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0169355","volume":"12","author":"X Wang","year":"2017","unstructured":"Wang X, Liu G, Li J, Nees JP (2017) Locating structural centers: A density-based clustering method for community detection. PloS one 12(1):e0169355","journal-title":"PloS one"},{"key":"1249_CR23","doi-asserted-by":"publisher","first-page":"25258","DOI":"10.1109\/ACCESS.2017.2769484","volume":"5","author":"X Wang","year":"2017","unstructured":"Wang X, Liu G, Li J (2017) Overlapping community detection based on structural centrality in complex networks. IEEE Access 5:25258\u201325269","journal-title":"IEEE Access"},{"issue":"12","key":"1249_CR24","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.3390\/e21121145","volume":"21","author":"B Cai","year":"2019","unstructured":"Cai B, Zeng L, Wang Y, Li H, Hu Y (2019) Community detection method based on node density, degree centrality, and k-means clustering in complex network. Entropy 21(12):1145","journal-title":"Entropy"},{"key":"1249_CR25","volume":"974","author":"AM Rukmi","year":"2018","unstructured":"Rukmi AM, Utomo DB, Sholikhah NI (2018) Study of parameters of the nearest neighbour shared algorithm on clustering documents. J Phys: Conf Ser 974:012061","journal-title":"J Phys: Conf Ser"},{"issue":"1","key":"1249_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.fss.2003.06.007","volume":"143","author":"EP Klement","year":"2004","unstructured":"Klement EP, Mesiar R, Pap E (2004) Triangular norms. position paper I: basic analytical and algebraic properties. Fuzzy Sets Syst 143(1):5\u201326","journal-title":"Fuzzy Sets Syst"},{"key":"1249_CR27","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-7091-6045-9_35","volume":"2","author":"K Menger","year":"2003","unstructured":"Menger K (2003) Statistical metrics. Selecta Mathematica 2:433\u2013435","journal-title":"Selecta Mathematica"},{"key":"1249_CR28","unstructured":"Schweizer B and Sklar A (2011) Probabilistic metric spaces. Courier Corporation"},{"key":"1249_CR29","unstructured":"Patel AM (2020) Accelerating transitive closure of large-scale sparse graphs. New Jersey Institute of Technology"},{"issue":"23","key":"1249_CR30","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582","journal-title":"Proc Natl Acad Sci"},{"key":"1249_CR31","first-page":"2837","volume":"11","author":"N Xuan","year":"2010","unstructured":"Xuan N, Julien V, Wales S, Bailey J (2010) Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J Machine Learning Res 11:2837\u20132854","journal-title":"J Machine Learning Res"},{"issue":"1","key":"1249_CR32","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif 2(1):193\u2013218","journal-title":"J Classif"},{"issue":"6","key":"1249_CR33","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"issue":"4","key":"1249_CR34","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TFUZZ.2002.800654","volume":"10","author":"H Naessens","year":"2002","unstructured":"Naessens H, De Meyer H, De Baets B (2002) Algorithms for the computation of t-transitive closures. IEEE Trans Fuzzy Syst 10(4):541\u2013551","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"4","key":"1249_CR35","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","journal-title":"J Anthropol Res"},{"key":"1249_CR36","doi-asserted-by":"crossref","unstructured":"Lusseau D (2003) The emergent properties of a dolphin social network. Proc R Soc Lond Ser B: Biol Sci \u00a0270(suppl_2):S186\u2013S188","DOI":"10.1098\/rsbl.2003.0057"},{"key":"1249_CR37","unstructured":"Benham T, Duan Q,  Kroese DP, and \u00a0Liquet B (2015) Ceoptim: cross-entropy r package for optimization, arXiv preprint arXiv:1503.01842"},{"key":"1249_CR38","doi-asserted-by":"crossref","unstructured":"Adamic LA and Glance N (2005) The political blogosphere and the 2004 us election: divided they blog. In: Proceedings of the 3rd international workshop on Link discovery, pp\u00a036\u201343, ACM","DOI":"10.1145\/1134271.1134277"},{"issue":"04","key":"1249_CR39","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1142\/S0219525903001067","volume":"6","author":"PM Gleiser","year":"2003","unstructured":"Gleiser PM, Danon L (2003) Community structure in jazz. Adv Compl Syst 6(04):565\u2013573","journal-title":"Adv Compl Syst"},{"issue":"2","key":"1249_CR40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"issue":"6","key":"1249_CR41","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimera","year":"2003","unstructured":"Guimera R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68(6):065103","journal-title":"Phys Rev E"},{"key":"1249_CR42","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on world wide web, pp\u00a01343\u20131350","DOI":"10.1145\/2487788.2488173"},{"key":"1249_CR43","doi-asserted-by":"crossref","unstructured":"Hartigan JA and  Wong MA (1979) Algorithm as 136: a k-means clustering algorithm. J R Stat Soc Ser c (Appl Stat)\u00a028(1):100\u2013108","DOI":"10.2307\/2346830"},{"issue":"6","key":"1249_CR44","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111","journal-title":"Phys Rev E"},{"issue":"1","key":"1249_CR45","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47","journal-title":"Rev Mod Phys"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01249-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-023-01249-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01249-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T11:10:44Z","timestamp":1709377844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-023-01249-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,29]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1249"],"URL":"https:\/\/doi.org\/10.1007\/s00607-023-01249-8","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2024,1,29]]},"assertion":[{"value":"8 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors do not have any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}