{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:02:13Z","timestamp":1743098533297,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"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_19","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"220-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Simple Extension of\u00a0the\u00a0Bag-of-Paths Model Weighting Path Lengths by\u00a0a\u00a0Poisson Distribution"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Courtain","sequence":"first","affiliation":[]},{"given":"Marco","family":"Saerens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"5","key":"19_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0191-2615(96)00003-3","volume":"30","author":"T Akamatsu","year":"1996","unstructured":"Akamatsu, T.: Cyclic flows, Markov process and stochastic traffic assignment. Transp. Res. B 30(5), 369\u2013386 (1996)","journal-title":"Transp. Res. B"},{"key":"19_CR2","series-title":"Springer Series in Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28981-X","volume-title":"Modern Multidimensional Scaling","author":"I Borg","year":"2005","unstructured":"Borg, I., Groenen, P.J.F.: Modern Multidimensional Scaling. SSS, Springer, New York (2005). https:\/\/doi.org\/10.1007\/0-387-28981-X"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27:1\u201327:27 (2011)","DOI":"10.1145\/1961189.1961199"},{"issue":"9","key":"19_CR4","first-page":"1505","volume":"58","author":"P Chebotarev","year":"1997","unstructured":"Chebotarev, P., Shamis, E.: The matrix-forest theorem and measuring relations in small social groups. Autom. Remote Control 58(9), 1505\u20131514 (1997)","journal-title":"Autom. Remote Control"},{"issue":"5","key":"19_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.dam.2010.11.017","volume":"159","author":"P Chebotarev","year":"2011","unstructured":"Chebotarev, P.: A class of graph-geodetic distances generalizing the shortest-path and the resistance distances. Discret. Appl. Math. 159(5), 295\u2013302 (2011)","journal-title":"Discret. Appl. Math."},{"key":"19_CR6","unstructured":"Consul, P.C.: Generalized Poisson Distributions: Properties and Applications. Marcel Dekker (1989)"},{"key":"19_CR7","unstructured":"Courtain, S., Guex, G., Kivimaki, I., Saerens, M.: Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison. ArXiv preprint arXiv:0912.0238v9 (2021)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.ins.2020.10.005","volume":"556","author":"S Courtain","year":"2020","unstructured":"Courtain, S., Leleux, P., Kivimaki, I., Guex, G., Saerens, M.: Randomized shortest paths with net flows and capacity constraints. Inf. Sci. 556, 341\u2013360 (2020)","journal-title":"Inf. Sci."},{"key":"19_CR9","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-030-36683-4_4","volume-title":"Complex Networks and Their Applications VIII","author":"S Courtain","year":"2020","unstructured":"Courtain, S., Lebichot, B., Kivim\u00e4ki, I., Saerens, M.: Graph-based fraud detection with the free energy distance. In: Cherifi, H., Gaito, S., Mendes, J.F., Moro, E., Rocha, L.M. (eds.) COMPLEX NETWORKS 2019. SCI, vol. 882, pp. 40\u201352. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-36683-4_4"},{"key":"19_CR10","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Devooght, R., Mantrach, A., Kivim\u00e4ki, I., Bersini, H., Jaimes, A., Saerens, M.: Random walks based modularity: application to semi-supervised learning. In: Proceedings of the 23rd International World Wide Web Conference (WWW 2014), pp. 213\u2013224 (2014)","DOI":"10.1145\/2566486.2567986"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.77.036111","volume":"77","author":"E Estrada","year":"2008","unstructured":"Estrada, E., Hatano, N.: Communicability in complex networks. Phys. Rev. E 77(3), 036111 (2008)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss, F., Pirotte, A., Renders, J.M., Saerens, M.: Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19(3), 355\u2013369 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.neunet.2017.03.010","volume":"90","author":"K Francoisse","year":"2017","unstructured":"Francoisse, K., Kivimki, I., Mantrach, A., Rossi, F., Saerens, M.: A bag-of-paths framework for network data analysis. Neural Netw. 90, 90\u2013111 (2017)","journal-title":"Neural Netw."},{"key":"19_CR15","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. J. Complex Netw. 8(6), 1\u201346 (2021)","DOI":"10.1093\/comnet\/cnaa026"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1017\/nws.2018.29","volume":"7","author":"G Guex","year":"2019","unstructured":"Guex, G., Kivim\u00e4ki, I., Saerens, M.: Randomized optimal transport on a graph: framework and new distance measures. Netw. Sci. 7(1), 88\u2013122 (2019)","journal-title":"Netw. Sci."},{"key":"19_CR17","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-56829-4_8","volume-title":"Models, Algorithms, and Technologies for Network Analysis","author":"V Ivashkin","year":"2017","unstructured":"Ivashkin, V., Chebotarev, P.: Do logarithmic proximity measures outperform plain ones in graph clustering? In: Kalyagin, V.A., Nikolaev, A.I., Pardalos, P.M., Prokopyev, O.A. (eds.) NET 2016. SPMS, vol. 197, pp. 87\u2013105. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56829-4_8"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Ivashkin, V., Chebotarev, P.: Dissecting graph measures performance for node clustering in LFR parameter space (2021). Preprint available at https:\/\/openreview.net\/forum?id=HkUfnZFt1Rw","DOI":"10.1007\/978-3-030-93409-5_28"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep19668","volume":"6","author":"I Kivim\u00e4ki","year":"2016","unstructured":"Kivim\u00e4ki, I., Lebichot, B., Saram\u00e4ki, J., Saerens, M.: Two betweenness centrality measures based on randomized shortest paths. Sci. Rep. 6(1), 1\u201315 (2016)","journal-title":"Sci. Rep."},{"key":"19_CR20","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. Physica A 393, 600\u2013616 (2014)","journal-title":"Physica A"},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"DJ Klein","year":"1993","unstructured":"Klein, D.J., Randic, M.: Resistance distance. J. Math. Chem. 12(1), 81\u201395 (1993)","journal-title":"J. Math. Chem."},{"key":"19_CR22","unstructured":"Kondor, R.I., Lafferty, J.: Diffusion kernels on graphs and other discrete structures. In: Proceedings of the 19th International Conference on Machine Learning (ICML 2002), pp. 315\u2013322 (2002)"},{"issue":"3","key":"19_CR23","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1007\/s10618-021-00742-y","volume":"35","author":"P Leleux","year":"2021","unstructured":"Leleux, P., Courtain, S., Guex, G., Saerens, M.: Sparse randomized shortest paths routing with Tsallis divergence regularization. Data Min. Knowl. Disc. 35(3), 986\u20131031 (2021). https:\/\/doi.org\/10.1007\/s10618-021-00742-y","journal-title":"Data Min. Knowl. Disc."},{"key":"19_CR24","unstructured":"Leleux, P., Courtain, S., Fran\u00e7oisse, K., Saerens, M.: Design of biased random walks on a graph with application to collaborative recommendation. Submitted for publication (2020)"},{"key":"19_CR25","unstructured":"Lichman, M.: UCI machine learning repository (2013)"},{"key":"19_CR26","first-page":"935","volume":"8","author":"SA Macskassy","year":"2007","unstructured":"Macskassy, S.A., Provost, F.: Classification in networked data: a toolkit and a univariate case study. J. Mach. Learn. Res. 8, 935\u2013983 (2007)","journal-title":"J. Mach. Learn. Res."},{"issue":"8","key":"19_CR27","doi-asserted-by":"publisher","first-page":"2363","DOI":"10.1162\/neco.2009.11-07-643","volume":"21","author":"M Saerens","year":"2009","unstructured":"Saerens, M., Achbany, Y., Fouss, F., Yen, L.: Randomized shortest-path problems: two related models. Neural Comput. 21(8), 2363\u20132404 (2009)","journal-title":"Neural Comput."},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf, B., Smola, A.: Learning with Kernels. MIT Press, Cambridge (2002)","DOI":"10.7551\/mitpress\/4175.001.0001"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-319-44778-0_23","volume-title":"Artificial Neural Networks and Machine Learning \u2013 ICANN 2016","author":"F Sommer","year":"2016","unstructured":"Sommer, F., Fouss, F., Saerens, M.: Comparison of graph node distances on clustering tasks. In: Villa, A.E.P., Masulli, P., Pons Rivero, A.J. (eds.) ICANN 2016. LNCS, vol. 9886, pp. 192\u2013201. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44778-0_23"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-319-68612-7_48","volume-title":"Artificial Neural Networks and Machine Learning \u2013 ICANN 2017","author":"F Sommer","year":"2017","unstructured":"Sommer, F., Fouss, F., Saerens, M.: Modularity-driven Kernel k-means for community detection. In: Lintas, A., Rovetta, S., Verschure, P.F.M.J., Villa, A.E.P. (eds.) ICANN 2017. LNCS, vol. 10614, pp. 423\u2013433. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68612-7_48"},{"key":"19_CR31","unstructured":"von\u00a0Luxburg, U., Radl, A., Hein, M.: Getting lost in space: Large sample analysis of the commute distance. In: Advances in Neural Information Processing Systems: Proceedings of the NIPS 2010 Conference, vol. 23, pp. 2622\u20132630 (2010)"},{"issue":"3","key":"19_CR32","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":"19_CR33","doi-asserted-by":"crossref","unstructured":"Yen, L., Mantrach, A., Shimbo, M., Saerens, 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 (KDD 2008), 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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:40:26Z","timestamp":1726407626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93409-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934088","9783030934095"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93409-5_19","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"}}]}}