{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:03:00Z","timestamp":1743058980386,"version":"3.40.3"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934088"},{"type":"electronic","value":"9783030934095"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-93409-5_28","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"328-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dissecting Graph Measure Performance for\u00a0Node Clustering in\u00a0LFR Parameter Space"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Ivashkin","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Chebotarev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"28_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. Stanford University, Technical report (2006)"},{"key":"28_CR2","doi-asserted-by":"publisher","unstructured":"Avrachenkov, K., Chebotarev, P., Rubanov, D.: Kernels on graphs as proximity measures. In: International Workshop on Algorithms and Models for the Web-Graph, pp. 27\u201341. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-67810-8_3","DOI":"10.1007\/978-3-319-67810-8_3"},{"key":"28_CR3","doi-asserted-by":"publisher","unstructured":"Aynulin, R.: Efficiency of transformations of proximity measures for graph clustering. In: International Workshop on Algorithms and Models for the Web-Graph, pp. 16\u201329. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-25070-6_2","DOI":"10.1007\/978-3-030-25070-6_2"},{"key":"28_CR4","doi-asserted-by":"publisher","unstructured":"Aynulin, R.: Impact of network topology on efficiency of proximity measures for community detection. In: International Conference on Complex Networks and Their Applications, pp. 188\u2013197. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-36687-2_16","DOI":"10.1007\/978-3-030-36687-2_16"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Barber, M.J., Clark, J.W.: Detecting network communities by propagating labels under constraints. Phys. Rev. E 80(2), 026129 (2009)","DOI":"10.1103\/PhysRevE.80.026129"},{"issue":"10","key":"28_CR6","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":"28_CR7","unstructured":"Borg, I., Groenen, P.J.F.: Modern Multidimensional Scaling: Theory and Applications. Springer Science & Business Media (2005)"},{"key":"28_CR8","unstructured":"Buckley, F., Harary, F.: Distance in Graphs. Addison-Wesley, Boston (1990)"},{"key":"28_CR9","doi-asserted-by":"publisher","unstructured":"Chebotarev, P.: Studying new classes of graph metrics. In: International Conference on Geometric Science of Information, pp. 207\u2013214. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-40020-9_21","DOI":"10.1007\/978-3-642-40020-9_21"},{"key":"28_CR10","unstructured":"Chebotarev, P., Shamis, E.: On the proximity measure for graph vertices provided by the inverse Laplacian characteristic matrix. In: Abstracts of the Conference \u201cLinear Algebra and its Applications\u201d, pp. 6\u20137. University of Manchester, Manchester, UK (1995)"},{"issue":"4","key":"28_CR11","first-page":"608","volume":"59","author":"P Chebotarev","year":"1998","unstructured":"Chebotarev, P., Shamis, E.: On a duality between metrics and $${\\rm \\Sigma }$$-proximities. Autom. Remote Control 59(4), 608\u2013612 (1998)","journal-title":"Autom. Remote Control"},{"issue":"10","key":"28_CR12","first-page":"1443","volume":"59","author":"P Chebotarev","year":"1998","unstructured":"Chebotarev, P., Shamis, E.: On proximity measures for graph vertices. Autom. Remote Control 59(10), 1443\u20131459 (1998)","journal-title":"Autom. Remote Control"},{"issue":"50","key":"28_CR13","doi-asserted-by":"publisher","first-page":"19735","DOI":"10.1073\/pnas.0708838104","volume":"104","author":"F Chung","year":"2007","unstructured":"Chung, F.: The heat kernel as the pagerank of a graph. Proc. Nat. Acad. Sci. 104(50), 19735\u201319740 (2007)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"28_CR14","first-page":"163","volume":"6","author":"F Chung","year":"1998","unstructured":"Chung, F., Yau, S.T.: Coverings, heat kernels and spanning trees. J. Comb. 6, 163\u2013184 (1998)","journal-title":"J. Comb."},{"key":"28_CR15","unstructured":"Chung, F.R.K.: Spectral Graph Theory, vol.\u00a092. American Mathematical Society (1997)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Courtain, S., Leleux, P., Kivim\u00e4ki, I., Guex, G., Saerens, M.: Randomized shortest paths with net flows and capacity constraints. Inform. Sci. 556, 341\u2013360 (2020)","DOI":"10.1016\/j.ins.2020.10.005"},{"issue":"7","key":"28_CR17","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1093\/nar\/30.7.1575","volume":"30","author":"AJ Enright","year":"2002","unstructured":"Enright, A.J., Van Dongen, S., Ouzounis, C.A.: An efficient algorithm for large-scale detection of protein families. Nucleic Acids Res. 30(7), 1575\u20131584 (2002)","journal-title":"Nucleic Acids Res."},{"issue":"1\u20133","key":"28_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.cplett.2007.03.098","volume":"439","author":"E Estrada","year":"2007","unstructured":"Estrada, E., Hatano, N.: Statistical-mechanical approach to subgraph centrality in complex networks. Chem. Phys. Lett. 439(1\u20133), 247\u2013251 (2007)","journal-title":"Chem. Phys. Lett."},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Estrada, E., Hatano, N.: Communicability in complex networks. Phys. Rev. E 77(3), 036111 (2008)","DOI":"10.1103\/PhysRevE.77.036111"},{"issue":"2","key":"28_CR20","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/j.jmaa.2016.12.062","volume":"449","author":"E Estrada","year":"2017","unstructured":"Estrada, E., Silver, G.: Accounting for the role of long walks on networks via a new matrix function. J. Math. Anal. Appl. 449(2), 1581\u20131600 (2017)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"28_CR21","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato, S., Barthelemy, M.: Resolution limit in community detection. Proc. Nat. Acad. Sci. 104(1), 36\u201341 (2007)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"152","key":"28_CR22","doi-asserted-by":"publisher","first-page":"20180677","DOI":"10.1098\/rsif.2018.0677","volume":"16","author":"B Fotouhi","year":"2019","unstructured":"Fotouhi, B., Momeni, N., Allen, B., Nowak, M.A.: Evolution of cooperation on large networks with community structure. J. R. Soc. Interface 16(152), 20180677 (2019)","journal-title":"J. R. Soc. Interface"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.neunet.2012.03.001","volume":"31","author":"F Fouss","year":"2012","unstructured":"Fouss, F., Francoisse, K., Yen, L., Pirotte, A., Saerens, M.: An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural Netw. 31, 53\u201372 (2012)","journal-title":"Neural Netw."},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Fouss, F., Saerens, M., Shimbo, M.: Algorithms and Models for Network Data and Link Analysis. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781316418321"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Fouss, F., Yen, L., Pirotte, A., Saerens, M.: An experimental investigation of graph kernels on a collaborative recommendation task. In: Sixth International Conference on Data Mining (ICDM\u201906), pp. 863\u2013868. IEEE (2006)","DOI":"10.1109\/ICDM.2006.18"},{"issue":"4","key":"28_CR26","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-4149(74)90001-5","volume":"2","author":"F G\u00f6bel","year":"1974","unstructured":"G\u00f6bel, F., Jagers, A.A.: Random walks on graphs. Stochastic Process. Appl. 2(4), 311\u2013336 (1974)","journal-title":"Stochastic Process. Appl."},{"key":"28_CR27","unstructured":"G\u00f6sgens, M., Prokhorenkova, L., Tikhonov, A.: Systematic analysis of cluster similarity indices: Towards bias-free cluster validation. arXiv preprint arXiv:1911.04773 (2019)"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Guex, G., Courtain, S., Saerens, M.: Covariance and correlation kernels on a graph in the generalized bag-of-paths formalism. arXiv preprint arXiv:1902.03002 (2019)","DOI":"10.1093\/comnet\/cnaa026"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Guex, G., Kivim\u00e4ki, I., Saerens, M.: Randomized optimal transport on a graph: framework and new distance measures. arXiv preprint arXiv:1806.03232 (2018)","DOI":"10.1017\/nws.2018.29"},{"issue":"2","key":"28_CR30","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Netw. 5(2), 109\u2013137 (1983)","journal-title":"Soc. Netw."},{"issue":"1","key":"28_CR31","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."},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Ivashkin, V., Chebotarev, P.: Do logarithmic proximity measures outperform plain ones in graph clustering? In: International Conference on Network Analysis, pp. 87\u2013105. Springer (2016)","DOI":"10.1007\/978-3-319-56829-4_8"},{"key":"28_CR33","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.laa.2017.09.029","volume":"537","author":"KA Jacobsen","year":"2018","unstructured":"Jacobsen, K.A., Tien, J.H.: A generalized inverse for graphs with absorption. Linear Algebra Appl. 537, 118\u2013147 (2018)","journal-title":"Linear Algebra Appl."},{"key":"28_CR34","unstructured":"Kandola, J., Cristianini, N., Shawe-Taylor, J.S.: Learning semantic similarity. In: Advances in Neural Information Processing Systems, pp. 673\u2013680 (2003)"},{"issue":"1","key":"28_CR35","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"key":"28_CR36","doi-asserted-by":"crossref","unstructured":"Kirkland, S.J., Neumann, M.: Group Inverses of M-matrices and Their Applications. CRC Press, Boca Raton (2012)","DOI":"10.1201\/b13054"},{"key":"28_CR37","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.physa.2013.09.016","volume":"393","author":"I Kivim\u00e4ki","year":"2014","unstructured":"Kivim\u00e4ki, I., Shimbo, M., Saerens, M.: Developments in the theory of randomized shortest paths with a comparison of graph node distances. Phys. A: Stat. Mech. Appl. 393, 600\u2013616 (2014)","journal-title":"Phys. A: Stat. Mech. Appl."},{"key":"28_CR38","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"28_CR39","doi-asserted-by":"crossref","unstructured":"Leleux, P., Courtain, S., Guex, G., Saerens, M.: Sparse randomized shortest paths routing with tsallis divergence regularization. arXiv preprint arXiv:2007.00419 (2020)","DOI":"10.1007\/s10618-021-00742-y"},{"issue":"2","key":"28_CR40","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in pcm. IEEE Trans. Inform. Theor. 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inform. Theor."},{"key":"28_CR41","unstructured":"Luxburg, U.V., Radl, A., Hein, M.: Getting lost in space: Large sample analysis of the resistance distance. In: Advances in Neural Information Processing Systems, pp. 2622\u20132630 (2010)"},{"key":"28_CR42","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol.\u00a014, pp. 281\u2013297. Oakland, CA, USA (1967)"},{"key":"28_CR43","unstructured":"Mika, S., Ratsch, G., Weston, J., Scholkopf, B., Mullers, K.R.: Fisher discriminant analysis with kernels. In: Neural Networks for Signal Processing IX: Proceedings of the 1999 IEEE Signal Processing Society Workshop, pp. 41\u201348. IEEE (1999)"},{"key":"28_CR44","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"28_CR45","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"key":"28_CR46","doi-asserted-by":"publisher","first-page":"10901","DOI":"10.1109\/ACCESS.2017.2714018","volume":"5","author":"MQ Pasta","year":"2017","unstructured":"Pasta, M.Q., Zaidi, F.: Topology of complex networks and performance limitations of community detection algorithms. IEEE Access 5, 10901\u201310914 (2017)","journal-title":"IEEE Access"},{"key":"28_CR47","doi-asserted-by":"publisher","unstructured":"Prokhorenkova, L.: Using synthetic networks for parameter tuning in community detection. In: International Workshop on Algorithms and Models for the Web-Graph, pp. 1\u201315. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-25070-6_1","DOI":"10.1007\/978-3-030-25070-6_1"},{"key":"28_CR48","doi-asserted-by":"crossref","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"28_CR49","doi-asserted-by":"crossref","unstructured":"Shawe-Taylor, J., Cristianini, N., et al.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)","DOI":"10.1017\/CBO9780511809682"},{"key":"28_CR50","doi-asserted-by":"publisher","unstructured":"Sommer, F., Fouss, F., Saerens, M.: Comparison of graph node distances on clustering tasks. In: International Conference on Artificial Neural Networks, pp. 192\u2013201. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-44778-0_23","DOI":"10.1007\/978-3-319-44778-0_23"},{"key":"28_CR51","doi-asserted-by":"publisher","unstructured":"Sommer, F., Fouss, F., Saerens, M.: Modularity-driven kernel k-means for community detection. In: International Conference on Artificial Neural Networks, pp. 423\u2013433. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-68612-7_48","DOI":"10.1007\/978-3-319-68612-7_48"},{"key":"28_CR52","unstructured":"Van\u00a0Dongen, S.M.: Graph Clustering by Flow Smulation. Ph.D. thesis, Utrecht University (2000)"},{"issue":"4","key":"28_CR53","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.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"key":"28_CR54","doi-asserted-by":"publisher","unstructured":"Yen, L., Fouss, F., Decaestecker, C., Francq, P., Saerens, M.: Graph nodes clustering based on the commute-time kernel. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 1037\u20131045. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-71701-0_117","DOI":"10.1007\/978-3-540-71701-0_117"},{"issue":"3","key":"28_CR55","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.datak.2008.10.006","volume":"68","author":"L Yen","year":"2009","unstructured":"Yen, L., Fouss, F., Decaestecker, C., Francq, P., Saerens, M.: Graph nodes clustering with the sigmoid commute-time kernel: a comparative study. Data Knowl. Eng. 68(3), 338\u2013361 (2009)","journal-title":"Data Knowl. Eng."},{"key":"28_CR56","doi-asserted-by":"crossref","unstructured":"Yen, L., Saerens, M., Mantrach, A., Shimbo, M.: A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 785\u2013793 (2008)","DOI":"10.1145\/1401890.1401984"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93409-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:34:16Z","timestamp":1682627656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93409-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934088","9783030934095"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93409-5_28","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}