{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T04:12:48Z","timestamp":1770351168027,"version":"3.49.0"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004744","name":"Innoviris","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004744","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009595","name":"Service Public de Wallonie","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s13042-022-01704-6","type":"journal-article","created":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T13:04:58Z","timestamp":1671800698000},"page":"1365-1390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison"],"prefix":"10.1007","volume":"14","author":[{"given":"Sylvain","family":"Courtain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Guex","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"Kivim\u00e4ki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Saerens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,23]]},"reference":[{"key":"1704_CR1","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 (2014) Developments in the theory of randomized shortest paths with a comparison of graph node distances. Phys A 393:600\u2013616. https:\/\/doi.org\/10.1016\/j.physa.2013.09.016","journal-title":"Phys A"},{"issue":"8","key":"1704_CR2","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 (2009) Randomized shortest-path problems: two related models. Neural Comput 21(8):2363\u20132404. https:\/\/doi.org\/10.1162\/neco.2009.11-07-643","journal-title":"Neural Comput"},{"key":"1704_CR3","doi-asserted-by":"publisher","unstructured":"Yen L, Mantrach A, Shimbo M, Saerens M (2008) 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 \u201908), pp 785\u2013793. https:\/\/doi.org\/10.1145\/1401890.1401984","DOI":"10.1145\/1401890.1401984"},{"key":"1704_CR4","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.physa.2015.12.117","volume":"450","author":"G Guex","year":"2016","unstructured":"Guex G (2016) Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets. Phys A 450:264\u2013277. https:\/\/doi.org\/10.1016\/j.physa.2015.12.117","journal-title":"Phys A"},{"issue":"1","key":"1704_CR5","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 (2019) Randomized optimal transport on a graph: framework and new distance measures. Netw Sci 7(1):88\u2013122. https:\/\/doi.org\/10.1017\/nws.2018.29","journal-title":"Netw Sci"},{"key":"1704_CR6","unstructured":"Cuturi M (2013) Sinkhorn distances: lightspeed computation of optimal transport. In: Advances in Neural Information Processing Systems 26: Proceedings of the NIPS \u201913 Conference, pp. 2292\u20132300. MIT Press, Cambridge"},{"key":"1704_CR7","volume-title":"The gravity model in transportation analysis. Theory and extensions","author":"S Erlander","year":"1990","unstructured":"Erlander S, Stewart N (1990) The gravity model in transportation analysis. Theory and extensions. VSP International Science Publishers, Utrecht"},{"key":"1704_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-2430-0_1","volume-title":"Entropy optimization principles with applications","author":"JN Kapur","year":"1992","unstructured":"Kapur JN, Kesavan HK (1992) Entropy optimization principles with applications. Academic Press, Cambridge"},{"key":"1704_CR9","volume-title":"Entropy in urban and regional modelling","author":"AG Wilson","year":"1970","unstructured":"Wilson AG (1970) Entropy in urban and regional modelling. Routledge, New York"},{"key":"1704_CR10","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 (2017) A bag-of-paths framework for network data analysis. Neural Netw 90:90\u2013111. https:\/\/doi.org\/10.1016\/j.neunet.2017.03.010","journal-title":"Neural Netw"},{"issue":"6","key":"1704_CR11","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TPAMI.2009.78","volume":"32","author":"A Mantrach","year":"2010","unstructured":"Mantrach A, Yen L, Callut J, Francoise K, Shimbo M, Saerens M (2010) The sum-over-paths covariance kernel: a novel covariance between nodes of a directed graph. IEEE Trans Pattern Anal Mach Intell 32(6):1112\u20131126. https:\/\/doi.org\/10.1109\/TPAMI.2009.78","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1704_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.10.005","author":"S Courtain","year":"2020","unstructured":"Courtain S, Leleux P, Kivimaki I, Guex G, Saerens M (2020) Randomized shortest paths with net flows and capacity constraints. Inform Sci. https:\/\/doi.org\/10.1016\/j.ins.2020.10.005","journal-title":"Inform Sci"},{"issue":"5","key":"1704_CR13","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 (1996) Cyclic flows, Markov process and stochastic traffic assignment. Transp Res B 30(5):369\u2013386. https:\/\/doi.org\/10.1016\/0191-2615(96)00003-3","journal-title":"Transp Res B"},{"key":"1704_CR14","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Hoboken"},{"key":"1704_CR15","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399\u2013404. https:\/\/doi.org\/10.4153\/CJM-1956-045-5","journal-title":"Can J Math"},{"key":"1704_CR16","doi-asserted-by":"crossref","unstructured":"Lempitsky V, Boykov Y (2007) Global optimization for shape fitting. In: Proceedings of the 12th IEEE International Computer Society Conference on Computer Vision and Pattern Recognition (CVPR \u201907), IEEE, pp 1\u20138","DOI":"10.1109\/CVPR.2007.383293"},{"key":"1704_CR17","doi-asserted-by":"crossref","unstructured":"Yuan J, Bae E, Tai X-C (2010) A study on continuous max-flow and min-cut approaches. In: Proceedings of the 15th IEEE International Computer Society Conference on Computer Vision and Pattern Recognition (CVPR\u201910), IEEE, pp 2217\u20132224","DOI":"10.1109\/CVPR.2010.5539903"},{"issue":"2","key":"1704_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/nav.21476","volume":"59","author":"R Kolisch","year":"2012","unstructured":"Kolisch R, Heimerl C (2012) An efficient metaheuristic for integrated scheduling and staffing it projects based on a generalized minimum cost flow network. Nav Res Logist 59(2):111\u2013127. https:\/\/doi.org\/10.1002\/nav.21476","journal-title":"Nav Res Logist"},{"key":"1704_CR19","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/848129","author":"O D\u00edaz-Parra","year":"2014","unstructured":"D\u00edaz-Parra O, Bern\u00e1be Loranca JAR-VB, Fuentes-Penna A, Barrera-C\u00e1mara RA (2014) A survey of transportation problems. J Appl Math. https:\/\/doi.org\/10.1155\/2014\/848129","journal-title":"J Appl Math"},{"issue":"5","key":"1704_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40819-021-01134-y","volume":"7","author":"Y Kacher","year":"2021","unstructured":"Kacher Y, Singh P (2021) A comprehensive literature review on transportation problems. Int J Appl Comput Math 7(5):1\u201349. https:\/\/doi.org\/10.1007\/s40819-021-01134-y","journal-title":"Int J Appl Comput Math"},{"issue":"2","key":"1704_CR21","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1287\/opre.2.2.150","volume":"2","author":"MM Flood","year":"1954","unstructured":"Flood MM (1954) Application of transportation theory to scheduling a military tanker fleet. J Oper Res Soc Am 2(2):150\u2013162. https:\/\/doi.org\/10.1287\/opre.2.2.150","journal-title":"J Oper Res Soc Am"},{"key":"1704_CR22","doi-asserted-by":"crossref","unstructured":"Helme MP (1992) Reducing air traffic delay in a space-time network. In: Proceedings of the 4th IEEE International Conference on Systems, Man, and Cybernetics (SMC \u201992), pp 236\u2013242","DOI":"10.1109\/ICSMC.1992.271770"},{"issue":"4","key":"1704_CR23","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.cie.2010.02.008","volume":"58","author":"U Y\u00fcceer","year":"2010","unstructured":"Y\u00fcceer U, \u00d6zak\u00e7 A (2010) A truck loading problem. Comput Indus Eng 58(4):766\u2013773. https:\/\/doi.org\/10.1016\/j.cie.2010.02.008","journal-title":"Comput Indus Eng"},{"issue":"5\u20136","key":"1704_CR24","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9 G, Cuturi M (2019) Computational optimal transport. Found Trends Mach Learn 11(5\u20136):355\u2013607. https:\/\/doi.org\/10.1561\/2200000073","journal-title":"Found Trends Mach Learn"},{"key":"1704_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32278-5","volume-title":"Graphs, networks, and algorithms","author":"D Jungnickel","year":"2013","unstructured":"Jungnickel D (2013) Graphs, networks, and algorithms, 4th edn. Springer, Berlin","edition":"4"},{"key":"1704_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/9781316888568","volume-title":"Network flow algorithms","author":"D Williamson","year":"2019","unstructured":"Williamson D (2019) Network flow algorithms. Cambridge University Press, Cambridge"},{"issue":"3","key":"1704_CR27","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0041-1647(67)90035-4","volume":"1","author":"AG Wilson","year":"1967","unstructured":"Wilson AG (1967) A statistical theory of spatial distribution models. Transp Res 1(3):253\u2013269. https:\/\/doi.org\/10.1016\/0041-1647(67)90035-4","journal-title":"Transp Res"},{"key":"1704_CR28","doi-asserted-by":"publisher","DOI":"10.4337\/9781839100598","volume-title":"Handbook on entropy. Complexity and spatial dynamics","author":"A Reggiani","year":"2021","unstructured":"Reggiani A, Schintler L, Czamanski D, Patuelli R (2021) Handbook on entropy. Complexity and spatial dynamics. Edward Elgar Publishing, Cheltenham"},{"issue":"9","key":"1704_CR29","doi-asserted-by":"publisher","first-page":"4675","DOI":"10.1109\/TAC.2016.2626796","volume":"62","author":"Y Chen","year":"2017","unstructured":"Chen Y, Georgiou TT, Pavon M, Tannenbaum A (2017) Robust transport over networks. IEEE Trans Autom Control 62(9):4675\u20134682. https:\/\/doi.org\/10.1109\/TAC.2016.2626796","journal-title":"IEEE Trans Autom Control"},{"issue":"7","key":"1704_CR30","doi-asserted-by":"publisher","first-page":"2287","DOI":"10.1109\/TAC.2017.2763418","volume":"63","author":"Y Chen","year":"2017","unstructured":"Chen Y, Georgiou TT, Pavon M, Tannenbaum A (2017) Efficient robust routing for single commodity network flows. IEEE Trans Autom Control 63(7):2287\u20132294. https:\/\/doi.org\/10.1109\/TAC.2017.2763418","journal-title":"IEEE Trans Autom Control"},{"issue":"4","key":"1704_CR31","doi-asserted-by":"publisher","first-page":"042104","DOI":"10.1063\/1.3372725","volume":"51","author":"M Pavon","year":"2010","unstructured":"Pavon M, Ticozzi F (2010) Discrete-time classical and quantum Markovian evolutions: maximum entropy problems on path space. J Math Phys 51(4):042104. https:\/\/doi.org\/10.1063\/1.3372725","journal-title":"J Math Phys"},{"issue":"2","key":"1704_CR32","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1137\/20M1339982","volume":"63","author":"Y Chen","year":"2021","unstructured":"Chen Y, Georgiou TT, Pavon M (2021) Stochastic control liaisons: Richard Sinkhorn meets Gaspard Monge on a Schrodinger bridge. SIAM Rev 63(2):249\u2013313. https:\/\/doi.org\/10.1137\/20M1339982","journal-title":"SIAM Rev"},{"key":"1704_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2022.110432","volume":"143","author":"F Arqu\u00e9","year":"2022","unstructured":"Arqu\u00e9 F, Uribe CA, Ocampo-Martinez C (2022) Approximate Wasserstein attraction flows for dynamic mass transport over networks. Automatica 143:110432. https:\/\/doi.org\/10.1016\/j.automatica.2022.110432","journal-title":"Automatica"},{"key":"1704_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-021-00742-y","author":"P Leleux","year":"2021","unstructured":"Leleux P, Courtain S, Guex G, Saerens M (2021) Sparse randomized shortest paths routing with Tsallis divergence regularization. Data Mining Knowledge Discov. https:\/\/doi.org\/10.1007\/s10618-021-00742-y","journal-title":"Data Mining Knowledge Discov"},{"key":"1704_CR35","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1103\/PhysRev.106.620","volume":"106","author":"ET Jaynes","year":"1957","unstructured":"Jaynes ET (1957) Information theory and statistical mechanics. Phys Rev 106:620\u2013630. https:\/\/doi.org\/10.1103\/PhysRev.106.620","journal-title":"Phys Rev"},{"key":"1704_CR36","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcm4h83","volume-title":"Statistical mechanics in a nutshell","author":"L Peliti","year":"2011","unstructured":"Peliti L (2011) Statistical mechanics in a nutshell. Princeton University Press, Princeton"},{"key":"1704_CR37","volume-title":"A modern course in statistical physics","author":"LE Reichl","year":"1998","unstructured":"Reichl LE (1998) A modern course in statistical physics, 2nd edn. Wiley, Hoboken","edition":"2"},{"key":"1704_CR38","volume-title":"Machine learning: discriminative and generative","author":"T Jebara","year":"2012","unstructured":"Jebara T (2012) Machine learning: discriminative and generative, vol 755. Springer, Berlin"},{"key":"1704_CR39","volume-title":"Nonlinear Programm","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear Programm, 2nd edn. Athena Scientific, Nashua","edition":"2"},{"key":"1704_CR40","volume-title":"Introduction a L\u2019optimisation","author":"J Culioli","year":"2012","unstructured":"Culioli J (2012) Introduction a L\u2019optimisation. Ellipses, Paris"},{"key":"1704_CR41","volume-title":"Linear and nonlinear optimization","author":"I Griva","year":"2008","unstructured":"Griva I, Nash S, Sofer A (2008) Linear and nonlinear optimization, 2nd edn. SIAM, Philadelphia","edition":"2"},{"key":"1704_CR42","volume-title":"Studies in linear and non-linear programming","author":"K Arrow","year":"1958","unstructured":"Arrow K, Hurwicz L, Uzawa H (1958) Studies in linear and non-linear programming. Stanford University Press, Palo Alto"},{"key":"1704_CR43","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/058","volume-title":"Topics in optimal transportation","author":"C Villani","year":"2003","unstructured":"Villani C (2003) Topics in optimal transportation. American Mathematical Society, Providence"},{"key":"1704_CR44","volume-title":"Optimal transport: old and new","author":"C Villani","year":"2008","unstructured":"Villani C (2008) Optimal transport: old and new. Springer, Berlin"},{"issue":"1\u20137","key":"1704_CR45","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. Computer Netw ISDN Syst 30(1\u20137):107\u2013117. https:\/\/doi.org\/10.1016\/S0169-7552(98)00110-X","journal-title":"Computer Netw ISDN Syst"},{"key":"1704_CR46","unstructured":"Page L, Brin S, Motwani R, Winograd T (1998) The PageRank citation ranking: Bringing order to the web. Technical report 1999-66, Computer Science Department, Stanford InfoLab, Stanford University, USA. http:\/\/ilpubs.stanford.edu:8090\/422\/"},{"key":"1704_CR47","unstructured":"Gori M, Pucci A (2007) ItemRank: a random-walk based scoring algorithm for recommender engines. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI \u201907), pp 2766\u20132771"},{"issue":"3","key":"1704_CR48","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10115-007-0094-2","volume":"14","author":"H Tong","year":"2008","unstructured":"Tong H, Faloutsos C, Pan J-Y (2008) Random walk with restart: fast solutions and applications. Knowl Inf Syst 14(3):327\u2013346. https:\/\/doi.org\/10.1007\/s10115-007-0094-2","journal-title":"Knowl Inf Syst"},{"key":"1704_CR49","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa026","author":"G Guex","year":"2020","unstructured":"Guex G, Courtain S, Saerens M (2020) Covariance and correlation kernels on a graph in the generalized bag-of-paths formalism. J Complex Netw. https:\/\/doi.org\/10.1093\/comnet\/cnaa026","journal-title":"J Complex Netw"},{"key":"1704_CR50","doi-asserted-by":"publisher","unstructured":"Sommer F, Fouss F, Saerens M (2016) Comparison of graph node distances on clustering tasks. In: Proceedings of the International Conference on Artificial Neural Networks (ICANN 2016). Lecture Notes in Computer Science, vol 9886, Springer, New York, pp 192\u2013201 . https:\/\/doi.org\/10.1007\/978-3-319-44778-0_23","DOI":"10.1007\/978-3-319-44778-0_23"},{"issue":"3","key":"1704_CR51","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 (2007) Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19(3):355\u2013369. https:\/\/doi.org\/10.1109\/TKDE.2007.46","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1704_CR52","doi-asserted-by":"publisher","unstructured":"Saerens M, Fouss F, Yen L, Dupont P (2004) The principal components analysis of a graph, and its relationships to spectral clustering. In: Proceedings of the 15th European Conference on Machine Learning (ECML \u201904). Lecture Notes in Artificial Intelligence, vol. 3201, pp 371\u2013383. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-30115-8_35","DOI":"10.1007\/978-3-540-30115-8_35"},{"key":"1704_CR53","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316418321","volume-title":"Algorithms and models for network data and link analysis","author":"F Fouss","year":"2016","unstructured":"Fouss F, Saerens M, Shimbo M (2016) Algorithms and models for network data and link analysis. Cambridge University Press, Cambridge"},{"key":"1704_CR54","doi-asserted-by":"publisher","unstructured":"Tang L, Liu H (2009) Relational learning via latent social dimensions. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201909), pp 817\u2013826 . https:\/\/doi.org\/10.1145\/1557019.1557109","DOI":"10.1145\/1557019.1557109"},{"key":"1704_CR55","doi-asserted-by":"crossref","unstructured":"Tang L, Liu H (2009) Scalable learning of collective behavior based on sparse social dimensions. In: Proceedings of the ACM Conference on Information and Knowledge Management (CIKM \u201909), pp 1107\u20131116","DOI":"10.1145\/1645953.1646094"},{"issue":"4","key":"1704_CR56","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/MIS.2010.36","volume":"25","author":"L Tang","year":"2010","unstructured":"Tang L, Liu H (2010) Toward predicting collective behavior via social dimension extraction. IEEE Intell Syst 25(4):19\u201325. https:\/\/doi.org\/10.1109\/MIS.2010.36","journal-title":"IEEE Intell Syst"},{"key":"1704_CR57","doi-asserted-by":"publisher","unstructured":"Zhang D, Mao R (2008) Classifying networked entities with modularity kernels. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management (CIKM 2008), ACM, pp 113\u2013122 . https:\/\/doi.org\/10.1145\/1458082.1458100","DOI":"10.1145\/1458082.1458100"},{"key":"1704_CR58","unstructured":"Zhang D, Mao R (2008) A new kernel for classification of networked entities. In: Proceedings of 6th International Workshop on Mining and Learning with Graphs, Helsinki, Finland"},{"key":"1704_CR59","first-page":"935","volume":"8","author":"SA Macskassy","year":"2007","unstructured":"Macskassy SA, Provost F (2007) Classification in networked data: a toolkit and a univariate case study. J Mach Learn Res 8:935\u2013983","journal-title":"J Mach Learn Res"},{"key":"1704_CR60","unstructured":"Dua D, Graff C (2017) UCI machine learning repository . http:\/\/archive.ics.uci.edu\/ml"},{"issue":"3","key":"1704_CR61","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 (2009) Graph nodes clustering with the sigmoid commute-time kernel: a comparative study. Data Knowl Eng 68(3):338\u2013361. https:\/\/doi.org\/10.1016\/j.datak.2008.10.006","journal-title":"Data Knowl Eng"},{"key":"1704_CR62","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1961189.1961199","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang C-C, Lin C-J (2011) LIBSVM: a library for support vector machines. ACM Trans Intell Syst Technol 2:27\u201312727. https:\/\/doi.org\/10.1145\/1961189.1961199","journal-title":"ACM Trans Intell Syst Technol"},{"key":"1704_CR63","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2711-1","volume-title":"Modern multidimensional scaling: theory and applications","author":"I Borg","year":"1997","unstructured":"Borg I, Groenen P (1997) Modern multidimensional scaling: theory and applications. Springer, Berlin"},{"key":"1704_CR64","volume-title":"Learning with kernels","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf B, Smola A (2002) Learning with kernels. MIT Press, Cambridge"},{"key":"1704_CR65","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330"},{"key":"1704_CR66","doi-asserted-by":"crossref","unstructured":"Doyle PG, Snell JL (1984) Random walks and electric networks, 1st edn. The Mathematical Association of America","DOI":"10.5948\/UPO9781614440222"},{"key":"1704_CR67","volume-title":"Matrix analysis for statistics","author":"J Schott","year":"2005","unstructured":"Schott J (2005) Matrix analysis for statistics, 2nd edn. Wiley, Hoboken","edition":"2"},{"key":"1704_CR68","volume-title":"Matrix algebra useful for statistics","author":"S Searle","year":"1982","unstructured":"Searle S (1982) Matrix algebra useful for statistics. Wiley, Hoboken"},{"key":"1704_CR69","unstructured":"Serre D (2002) Matrices. Theory and applications. Springer, Berlin"},{"issue":"6","key":"1704_CR70","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1016\/j.patcog.2010.11.020","volume":"44","author":"S Garc\u00eda-D\u00edez","year":"2011","unstructured":"Garc\u00eda-D\u00edez S, Fouss F, Shimbo M, Saerens M (2011) A sum-over-paths extension of edit distances accounting for all sequence alignments. Pattern Recogn 44(6):1172\u20131182. https:\/\/doi.org\/10.1016\/j.patcog.2010.11.020","journal-title":"Pattern Recogn"},{"key":"1704_CR71","doi-asserted-by":"publisher","first-page":"19668","DOI":"10.1038\/srep19668","volume":"6","author":"I Kivim\u00e4ki","year":"2016","unstructured":"Kivim\u00e4ki I, Lebichot B, Saram\u00e4ki J, Saerens M (2016) Two betweenness centrality measures based on randomized shortest paths. Sci Rep 6:19668","journal-title":"Sci Rep"},{"key":"1704_CR72","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5838-8","volume-title":"Optimization","author":"K Lange","year":"2013","unstructured":"Lange K (2013) Optimization, 2nd edn. Springer, Berlin","edition":"2"},{"key":"1704_CR73","volume-title":"Maximum-entropy models in science and engineering","author":"JN Kapur","year":"1989","unstructured":"Kapur JN (1989) Maximum-entropy models in science and engineering. Wiley, Hoboken"},{"key":"1704_CR74","doi-asserted-by":"publisher","unstructured":"Lebichot B, Guex G, Kivimaki I, Saerens M (2018) A constrained randomized shortest-paths framework for optimal exploration. ArXiv. https:\/\/doi.org\/10.48550\/arXiv.1807.04551","DOI":"10.48550\/arXiv.1807.04551"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-022-01704-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-022-01704-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-022-01704-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,18]],"date-time":"2023-03-18T08:22:51Z","timestamp":1679127771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-022-01704-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,23]]},"references-count":74,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1704"],"URL":"https:\/\/doi.org\/10.1007\/s13042-022-01704-6","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,23]]},"assertion":[{"value":"7 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}