{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:29Z","timestamp":1740122369511,"version":"3.37.3"},"reference-count":133,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T00:00:00Z","timestamp":1614988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T00:00:00Z","timestamp":1614988800000},"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s10618-021-00742-y","type":"journal-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T14:02:45Z","timestamp":1615039365000},"page":"986-1031","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Sparse randomized shortest paths routing with Tsallis divergence regularization"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7365-6057","authenticated-orcid":false,"given":"Pierre","family":"Leleux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8715-435X","authenticated-orcid":false,"given":"Sylvain","family":"Courtain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Guex","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":[[2021,3,6]]},"reference":[{"key":"742_CR1","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, Upper Saddle River"},{"issue":"5","key":"742_CR2","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","journal-title":"Transp Res B"},{"issue":"4","key":"742_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1287\/trsc.31.4.349","volume":"31","author":"T Akamatsu","year":"1997","unstructured":"Akamatsu T (1997) Decomposition of path choice entropy in general transport networks. Transp Sci 31(4):349\u2013362","journal-title":"Transp Sci"},{"key":"742_CR4","unstructured":"Alamgir M, von Luxburg U (2011) Phase transition in the family of p-resistances. In: Advances in neural information processing systems 24: proceedings of the NIPS 2011 conference. MIT Press, pp 379\u2013387"},{"key":"742_CR5","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, Stanford"},{"key":"742_CR6","volume-title":"Network science","author":"AL Barabasi","year":"2016","unstructured":"Barabasi AL (2016) Network science. Cambridge University Press, Cambridge"},{"key":"742_CR7","doi-asserted-by":"crossref","unstructured":"Bavaud F, Guex G (2012) Interpolating between random walks and shortest paths: a path functional approach. In: Aberer K, Flache A, Jager W, Liu L, Tang J, Gu\u00e9ret C (eds) Proceedings of the 4th international conference on social informatics (SocInfo\u201912). Lecture notes in computer science, vol 7710. Springer, pp 68\u201381","DOI":"10.1007\/978-3-642-35386-4_6"},{"key":"742_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973655","volume-title":"Introduction to nonlinear optimization","author":"A Beck","year":"2014","unstructured":"Beck A (2014) Introduction to nonlinear optimization. SIAM, New Delhi"},{"key":"742_CR9","unstructured":"Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Scientific"},{"key":"742_CR10","doi-asserted-by":"crossref","unstructured":"Bloem M, Bambos N (2014) Infinite time horizon maximum causal entropy inverse reinforcement learning. In: Proceedings of the 53rd IEEE conference on decision and control. IEEE, pp 4911\u20134916","DOI":"10.1109\/CDC.2014.7040156"},{"issue":"4","key":"742_CR11","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum M, Floyd RW, Pratt VR, Rivest RL, Tarjan RE (1973) Time bounds for selection. J Comput Syst Sci 7(4):448\u2013461","journal-title":"J Comput Syst Sci"},{"key":"742_CR12","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"},{"volume-title":"Network analysis: methodological foundations","year":"2005","key":"742_CR13","unstructured":"Brandes U, Erlebach T (eds) (2005) Network analysis: methodological foundations. Springer, Berlin"},{"key":"742_CR14","doi-asserted-by":"crossref","unstructured":"Brandes U, Fleischer D (2005) Centrality measures based on current flow. In: Proceedings of the 22nd annual symposium on theoretical aspects of computer science (STACS\u201905), pp 533\u2013544","DOI":"10.1007\/978-3-540-31856-9_44"},{"key":"742_CR15","volume-title":"Applied optimal control","author":"A Bryson","year":"1975","unstructured":"Bryson A, Ho YC (1975) Applied optimal control. Taylor and Francis, Milton Park"},{"key":"742_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20192-9","volume-title":"Statistics for high-dimensional data","author":"P Buhlmann","year":"2011","unstructured":"Buhlmann P, van de Geer S (2011) Statistics for high-dimensional data. Springer, Berlin"},{"key":"742_CR17","unstructured":"Busic A, Meyn S (2018) Action-constrained Markov decision processes with Kullback\u2013Leibler cost. In: Proceedings of the 31st conference on learning theory (COLT), PMLR 75, pp 1431\u20131444"},{"issue":"5","key":"742_CR18","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 (2011) A class of graph-geodetic distances generalizing the shortest-path and the resistance distances. Discrete Appl Math 159(5):295\u2013302","journal-title":"Discrete Appl Math"},{"issue":"10\u201311","key":"742_CR19","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1016\/j.dam.2012.02.015","volume":"160","author":"P Chebotarev","year":"2012","unstructured":"Chebotarev P (2012) The walk distances in graphs. Discrete Appl Math 160(10\u201311):1484\u20131500","journal-title":"Discrete Appl Math"},{"key":"742_CR20","doi-asserted-by":"crossref","unstructured":"Chebotarev P (2013) Studying new classes of graph metrics. In: Nielsen F, Barbaresco F (eds) Proceedings of the 1st international conference on geometric science of information (GSI\u201913). Lecture notes in computer science, vol 8085. Springer, pp 207\u2013214","DOI":"10.1007\/978-3-642-40020-9_21"},{"issue":"9","key":"742_CR21","first-page":"1505","volume":"58","author":"P Chebotarev","year":"1997","unstructured":"Chebotarev P, Shamis E (1997) The matrix-forest theorem and measuring relations in small social groups. Autom Remote Control 58(9):1505\u20131514","journal-title":"Autom Remote Control"},{"issue":"10","key":"742_CR22","first-page":"1443","volume":"59","author":"P Chebotarev","year":"1998","unstructured":"Chebotarev P, Shamis E (1998) On proximity measures for graph vertices. Autom Remote Control 59(10):1443\u20131459","journal-title":"Autom Remote Control"},{"key":"742_CR23","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/107","volume-title":"Complex graphs and networks","author":"F Chung","year":"2006","unstructured":"Chung F, Lu L (2006) Complex graphs and networks. American Mathematical Society, Providence"},{"issue":"1\u20132","key":"742_CR24","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0946-6","volume":"158","author":"L Condat","year":"2016","unstructured":"Condat L (2016) Fast projection onto the simplex and the $$\\ell _{1}$$ ball. Math Program 158(1\u20132):575\u2013585","journal-title":"Math Program"},{"key":"742_CR25","volume-title":"Introduction to algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen T, Leiserson C, Rivest R, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, Cambridge","edition":"3"},{"key":"742_CR26","doi-asserted-by":"crossref","unstructured":"Courtain S, Leleux P, Kivimki I, Guex G, Saerens M (2020) Randomized shortest paths with net flows and capacity constraints. To appear in Inf Sci","DOI":"10.1016\/j.ins.2020.10.005"},{"key":"742_CR27","volume-title":"Elements of information theory","author":"T Cover","year":"2006","unstructured":"Cover T, Thomas J (2006) Elements of information theory, 2nd edn. Wiley, Hoboken","edition":"2"},{"key":"742_CR28","unstructured":"Culioli J (2012) Introduction a l\u2019optimisation. Ellipses"},{"issue":"4","key":"742_CR29","doi-asserted-by":"publisher","first-page":"046117","DOI":"10.1103\/PhysRevE.83.046117","volume":"83","author":"JC Delvenne","year":"2011","unstructured":"Delvenne JC, Libert AS (2011) Centrality measures and thermodynamic formalism for complex networks. Phys Rev E 83(4):046117","journal-title":"Phys Rev E"},{"key":"742_CR30","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"742_CR31","volume-title":"Networks and algorithms: an introductory approach","author":"A Dolan","year":"1993","unstructured":"Dolan A, Aldous J (1993) Networks and algorithms: an introductory approach. Wiley, Hoboken"},{"key":"742_CR32","doi-asserted-by":"crossref","unstructured":"Doyle PG, Snell JL (1984) Random walks and electric networks. The Mathematical Association of America","DOI":"10.5948\/UPO9781614440222"},{"key":"742_CR33","doi-asserted-by":"crossref","unstructured":"Duchi J, Shalev-Shwartz S, Singer Y, Chandra T (2008) Efficient projections onto the l1-ball for learning in high dimensions. In: Proceedings of the 25th international conference on machine learning (ICML \u20192008), pp 272\u2013279","DOI":"10.1145\/1390156.1390191"},{"key":"742_CR34","volume-title":"The structure of complex networks","author":"E Estrada","year":"2012","unstructured":"Estrada E (2012) The structure of complex networks. Oxford University Press, Oxford"},{"issue":"3","key":"742_CR35","doi-asserted-by":"publisher","first-page":"036111","DOI":"10.1103\/PhysRevE.77.036111","volume":"77","author":"E Estrada","year":"2008","unstructured":"Estrada E, Hatano N (2008) Communicability in complex networks. Phys Rev E 77(3):036111","journal-title":"Phys Rev E"},{"key":"742_CR36","first-page":"1871","volume":"9","author":"RE Fan","year":"2008","unstructured":"Fan RE, Chang KW, Hsieh CJ, Wang XR, Lin CJ (2008) LIBLINEAR: a library for large linear classification. J Mach Learn Res 9:1871\u20131874","journal-title":"J Mach Learn Res"},{"issue":"3","key":"742_CR37","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 JM, 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","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"742_CR38","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":"742_CR39","unstructured":"Fox R, Pakman A, Tishby N (2001) G-learning: taming the noise in reinforcement learning via soft updates. In: Proceedings of the 22nd conference on uncertainty in artificial intelligence (UAI 2016), pp 202\u2013211"},{"key":"742_CR40","unstructured":"Fran\u00e7oisse K, Kivimaki I, Mantrach A, Rossi F, Saerens M (2013) A bag-of-paths framework for network data analysis. ArXiv preprint arXiv:1302.6766\/v1"},{"key":"742_CR41","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.neunet.2017.03.010","volume":"90","author":"K Fran\u00e7oisse","year":"2017","unstructured":"Fran\u00e7oisse K, Kivimaki I, Mantrach A, Rossi F, Saerens M (2017) A bag-of-paths framework for network data analysis. Neural Netw 90:90\u2013111","journal-title":"Neural Netw"},{"key":"742_CR42","unstructured":"Fred AL, Jain AK (2003) Robust data clustering. In: Proceedings of the 2003 IEEE international computer society conference on computer vision and pattern recognition (CVPR\u201903), vol\u00a02, pp 128\u2013133"},{"issue":"1","key":"742_CR43","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341","journal-title":"Sociometry"},{"issue":"6","key":"742_CR44","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 (2011a) A sum-over-paths extension of edit distances accounting for all sequence alignments. Pattern Recognit 44(6):1172\u20131182","journal-title":"Pattern Recognit"},{"key":"742_CR45","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-D\u00edez S, Vandenbussche E, Saerens M (2011b) A continuous-state version of discrete randomized shortest-paths. In: Proceedings of the 50th IEEE international conference on decision and control (CDC\u201911), pp 6570\u20136577","DOI":"10.1109\/CDC.2011.6160770"},{"key":"742_CR46","unstructured":"Geist M, Scherrer B, Pietquin O (2019) A theory of regularized Markov decision processes. In: Proceedings of the international conference on machine learning (ICML 2019), pp 2160\u20132169"},{"issue":"12","key":"742_CR47","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci USA"},{"key":"742_CR48","doi-asserted-by":"crossref","unstructured":"Griva I, Nash S, Sofer A (2008) Linear and nonlinear optimization, 2nd edn. SIAM","DOI":"10.1137\/1.9780898717730"},{"key":"742_CR49","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 Stat Mech Appl 450:264\u2013277","journal-title":"Phys A Stat Mech Appl"},{"key":"742_CR50","doi-asserted-by":"crossref","unstructured":"Guex G, Bavaud F (2015) Flow-based dissimilarities: shortest path, commute time, max-flow and free energy. In: Lausen B, Krolak-Schwerdt S, Bohmer M (eds) Data science, learning by latent structures, and knowledge discovery, studies in classification, data analysis, and knowledge organization, vol 1564. Springer, pp 101\u2013111","DOI":"10.1007\/978-3-662-44983-7_9"},{"issue":"1","key":"742_CR51","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1017\/nws.2018.29","volume":"7","author":"G Guex","year":"2019","unstructured":"Guex G, Kivimaki I, Saerens M (2019) Randomized optimal transport on a graph: framework and new distance measures. Netw Sci 7(1):88\u2013122","journal-title":"Netw Sci"},{"key":"742_CR52","doi-asserted-by":"crossref","unstructured":"Guex G, Courtain S, Saerens M (2020) Covariance and correlation kernels on a graph in the generalized bag-of-paths formalism. To appear in J Complex Netw","DOI":"10.1093\/comnet\/cnaa026"},{"key":"742_CR53","unstructured":"Hashimoto T, Sun Y, Jaakkola T (2015) From random walks to distances on unweighted graphs. In: Advances in neural information processing systems 24: proceedings of the NIPS \u201915 conference"},{"key":"742_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The elements of statistical learning: data mining, inference, and prediction","author":"T Hastie","year":"2009","unstructured":"Hastie T, Tibshirani R, Friedman J (2009) The elements of statistical learning: data mining, inference, and prediction. Springer, Berlin"},{"key":"742_CR55","doi-asserted-by":"publisher","DOI":"10.1201\/b18401","volume-title":"Statistical learning with sparsity","author":"T Hastie","year":"2015","unstructured":"Hastie T, Tibshirani R, Wainwright M (2015) Statistical learning with sparsity. CRC Press, Boca Raton"},{"key":"742_CR56","unstructured":"Havrda H, Charvat F (1967) Quantification method of classification processes. concept of structural $$\\alpha $$-entropy. Kybernetika 3(1):30\u201335"},{"key":"742_CR57","unstructured":"Hazan T, Shashua A (2007) An efficient algorithm for maximum Tsallis entropy using Fenchel-duality. Technical report TR-110, The Hebrew University of Jerusalem, Israel"},{"key":"742_CR58","doi-asserted-by":"crossref","unstructured":"Hazan T, Hardoon R, Shashua A (2007) Plsa for sparse arrays with Tsallis pseudo-additive divergence: noise robustness and algorithm. In: Proceedings of the 11th IEEE international conference on computer vision. IEEE, pp 1\u20138","DOI":"10.1109\/ICCV.2007.4409048"},{"key":"742_CR59","unstructured":"Herbster M, Lever G (2009) Predicting the labelling of a graph via minimum p-seminorm interpolation. In: Proceedings of the 22nd conference on learning theory (COLT\u201909), pp 18\u201321"},{"issue":"1","key":"742_CR60","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"},{"key":"742_CR61","doi-asserted-by":"crossref","unstructured":"Ivashkin V, Chebotarev P (2016) Do logarithmic proximity measures outperform plain ones in graph clustering? In: International conference on network analysis. Springer, pp 87\u2013105","DOI":"10.1007\/978-3-319-56829-4_8"},{"issue":"4","key":"742_CR62","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(4):620\u2013630","journal-title":"Phys Rev"},{"key":"742_CR63","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-41550-0_14","volume-title":"Modeling decisions for artificial intelligence","author":"Y Kanzawa","year":"2013","unstructured":"Kanzawa Y (2013) Generalization of quadratic regularized and standard fuzzy c-means clustering with respect to regularization of hard c-means. In: Torra V, Narukawa Y, Navarro-Arribas G, Meg\u00edas D (eds) Modeling decisions for artificial intelligence. Springer, Berlin, pp 152\u2013165"},{"issue":"1","key":"742_CR64","doi-asserted-by":"publisher","first-page":"34","DOI":"10.20965\/jaciii.2018.p0034","volume":"22","author":"Y Kanzawa","year":"2018","unstructured":"Kanzawa Y (2018) Q-divergence-based relational fuzzy c-means clustering. J Adv Comput Intell Intell Inf 22(1):34\u201343","journal-title":"J Adv Comput Intell Intell Inf"},{"issue":"2","key":"742_CR65","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10994-012-5278-7","volume":"87","author":"HJ Kappen","year":"2012","unstructured":"Kappen HJ, G\u00f3mez V, Opper M (2012) Optimal control as a graphical model inference problem. Mach Learn 87(2):159\u2013182","journal-title":"Mach Learn"},{"key":"742_CR66","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"},{"issue":"1","key":"742_CR67","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343","journal-title":"Psychometrika"},{"issue":"1","key":"742_CR68","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1111\/j.0030-1299.2005.13735.x","volume":"109","author":"C Keylock","year":"2005","unstructured":"Keylock C (2005) Simpson diversity and the Shannon\u2013Wiener index as special cases of a generalized entropy. Oikos 109(1):203\u2013207","journal-title":"Oikos"},{"key":"742_CR69","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 Stat Mech Appl 393:600\u2013616","journal-title":"Phys A Stat Mech Appl"},{"issue":"1","key":"742_CR70","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"DJ Klein","year":"1993","unstructured":"Klein DJ, Randic M (1993) Resistance distance. J Math Chem 12(1):81\u201395","journal-title":"J Math Chem"},{"key":"742_CR71","doi-asserted-by":"crossref","unstructured":"Kolaczyk ED (2009) Statistical analysis of network data: methods and models. Springer series in statistics. Springer","DOI":"10.1007\/978-0-387-88146-1"},{"key":"742_CR72","unstructured":"Kondor RI, Lafferty J (2002) Diffusion kernels on graphs and other discrete structures. In: Proceedings of the 19th international conference on machine learning (ICML\u201902), pp 315\u2013322"},{"key":"742_CR73","unstructured":"Laha A, Chemmengath SA, Agrawal P, Khapra M, Sankaranarayanan K, Ramaswamy H (2018) On controllable sparse alternatives to softmax. In: Advances in neural information processing systems 32: proceedings of the NeurIPS\u201918 conference, pp 6422\u20136432"},{"issue":"4","key":"742_CR74","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110","journal-title":"Phys Rev E"},{"key":"742_CR75","doi-asserted-by":"crossref","unstructured":"Lang K (1995) Newsweeder: learning to filter netnews. In: Proceedings of the 12th international machine learning conference (ML95), pp 331\u2013339","DOI":"10.1016\/B978-1-55860-377-6.50048-7"},{"key":"742_CR76","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.neucom.2017.06.054","volume":"275","author":"B Lebichot","year":"2018","unstructured":"Lebichot B, Kivimaki I, Saerens M (2018) A bag-of-paths node criticality measure. Neurocomputing 275:224\u2013236","journal-title":"Neurocomputing"},{"key":"742_CR77","unstructured":"Lee K, Choi S, Oh S (2018a) Maximum causal Tsallis entropy imitation learning. In: Advances in neural information processing systems 31: proceedings of the NIPS 2010 conference, pp 4403\u20134413"},{"issue":"3","key":"742_CR78","doi-asserted-by":"publisher","first-page":"1466","DOI":"10.1109\/LRA.2018.2800085","volume":"3","author":"K Lee","year":"2018","unstructured":"Lee K, Choi S, Oh S (2018b) Sparse Markov decision processes with causal sparse Tsallis entropy regularization for reinforcement learning. IEEE Robot Autom Lett 3(3):1466\u20131473","journal-title":"IEEE Robot Autom Lett"},{"key":"742_CR79","doi-asserted-by":"publisher","DOI":"10.1002\/9780470400791","volume-title":"Network science","author":"T Lewis","year":"2009","unstructured":"Lewis T (2009) Network science. Wiley, Hoboken"},{"key":"742_CR80","doi-asserted-by":"crossref","unstructured":"Li Y, Zhang ZL, Boley D (2011) The routing continuum from shortest-path to all-path: a unifying theory. In: Proceedings of the 31st international conference on distributed computing systems (ICDCS\u201911). IEEE Computer Society, pp 847\u2013856","DOI":"10.1109\/ICDCS.2011.57"},{"issue":"7","key":"742_CR81","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1109\/TPDS.2013.203","volume":"25","author":"Y Li","year":"2013","unstructured":"Li Y, Zhang ZL, Boley D (2013) From shortest-path to all-path: the routing continuum theory and its applications. IEEE Trans Parallel Distrib Syst 25(7):1745\u20131755","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"742_CR82","volume-title":"Introduction to dynamic systems: theory, models, and applications","author":"DG Luenberger","year":"1979","unstructured":"Luenberger DG (1979) Introduction to dynamic systems: theory, models, and applications. Wiley, Hoboken"},{"key":"742_CR83","volume-title":"Linear and nonlinear programming","author":"DG Luenberger","year":"2010","unstructured":"Luenberger DG, Ye Y (2010) Linear and nonlinear programming, 3rd edn. Springer, Berlin","edition":"3"},{"issue":"2","key":"742_CR84","first-page":"S186","volume":"270","author":"D Lusseau","year":"2003","unstructured":"Lusseau D (2003) The emergent properties of a dolphin social network. Proc R Soc Lond Ser B Biol Sci 270(2):S186\u2013S188","journal-title":"Proc R Soc Lond Ser B Biol Sci"},{"issue":"4","key":"742_CR85","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54(4):396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"key":"742_CR86","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":"742_CR87","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"C Manning","year":"2008","unstructured":"Manning C, Raghavan P, Sch\u00fctze H (2008) Introduction to information retrieval. Cambridge University Press, Cambridge"},{"key":"742_CR88","unstructured":"Martins A, Astudillo R (2016) From softmax to sparsemax: a sparse model of attention and multi-label classification. In: Proceedings of the international conference on machine learning (ICML-2016), pp 1614\u20131623"},{"issue":"6","key":"742_CR89","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1016\/S0031-3203(02)00049-3","volume":"36","author":"M Menard","year":"2003","unstructured":"Menard M, Courboulay V, Dardignac PA (2003) Possibilistic and probabilistic fuzzy clustering: unification within the framework of the non-extensive thermostatistics. Pattern Recognit 36(6):1325\u20131342","journal-title":"Pattern Recognit"},{"key":"742_CR90","volume-title":"Mathematical programming, theory and algorithms","author":"M Minoux","year":"1986","unstructured":"Minoux M (1986) Mathematical programming, theory and algorithms. Wiley, Hoboken"},{"key":"742_CR91","doi-asserted-by":"crossref","unstructured":"Miyamoto S, Umayahara K (1998) Fuzzy clustering by quadratic regularization. In: Proceedings of the IEEE international conference on fuzzy systems, pp 1394\u20131399","DOI":"10.1109\/FUZZY.1998.686323"},{"key":"742_CR92","volume-title":"Algorithms for fuzzy clustering","author":"S Miyamoto","year":"2008","unstructured":"Miyamoto S, Ichihashi H, Honda K (2008) Algorithms for fuzzy clustering. Springer, Berlin"},{"key":"742_CR93","doi-asserted-by":"crossref","unstructured":"Muzellec B, Nock R, Patrini G, Nielsen F (2017) Tsallis regularized optimal transport and ecological inference. In: Proceedings of the 31 international conference of the association for the advancement of artificial intelligence (AAAI 2017)","DOI":"10.1609\/aaai.v31i1.10854"},{"issue":"1","key":"742_CR94","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"MEJ Newman","year":"2005","unstructured":"Newman MEJ (2005) A measure of betweenness centrality based on random walks. Soc Netw 27(1):39\u201354","journal-title":"Soc Netw"},{"key":"742_CR95","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks: an introduction","author":"MEJ Newman","year":"2018","unstructured":"Newman MEJ (2018) Networks: an introduction, 2nd edn. Oxford University Press, Oxford","edition":"2"},{"key":"742_CR96","unstructured":"Ngyen C, Mamitsuka H (2016) New resistance distances with global information on large graphs. In: Proceedings of the 19th international conference on artificial intelligence and statistics (AISTATS\u201916), pp 639\u2013647"},{"key":"742_CR97","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810633","volume-title":"Markov chains","author":"JR Norris","year":"1997","unstructured":"Norris JR (1997) Markov chains. Cambridge University Press, Cambridge"},{"issue":"1","key":"742_CR98","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1111\/1365-2656.12386","volume":"85","author":"M Panzacchi","year":"2016","unstructured":"Panzacchi M, Van Moorter B, Strand O, Saerens M, Kivimaki I, St Clair C, Herfindal I, Boitani L (2016) Predicting the continuum between corridors and barriers to animal movements using step selection functions and randomized shortest paths. J Anim Ecol 85(1):32\u201342","journal-title":"J Anim Ecol"},{"key":"742_CR99","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":"742_CR100","volume-title":"Numerical recipes: the art of scientific computing","author":"W Press","year":"2007","unstructured":"Press W, Teukolsky S, Vetterling W, Flannery B (2007) Numerical recipes: the art of scientific computing, 3rd edn. Cambridge University Press, Cambridge","edition":"3"},{"key":"742_CR101","unstructured":"Price WL (1971) Graphs and networks: an introduction. London Butterworths"},{"issue":"336","key":"742_CR102","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846\u2013850","journal-title":"J Am Stat Assoc"},{"key":"742_CR103","volume-title":"Optimization in operations research","author":"R Rardin","year":"1998","unstructured":"Rardin R (1998) Optimization in operations research. Prentice Hall, Upper Saddle River"},{"key":"742_CR104","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":"742_CR105","first-page":"57","volume-title":"Trading value and information in MDPs","author":"J Rubin","year":"2012","unstructured":"Rubin J, Shamir O, Tishby N (2012) Trading value and information in MDPs. Springer, Berlin, pp 57\u201374"},{"issue":"8","key":"742_CR106","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","journal-title":"Neural Comput"},{"key":"742_CR107","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":"742_CR108","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17290-3","volume-title":"Machine learning in complex networks","author":"T Silva","year":"2016","unstructured":"Silva T, Zhao L (2016) Machine learning in complex networks. Springer, Berlin"},{"key":"742_CR109","doi-asserted-by":"crossref","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, pp 192\u2013201","DOI":"10.1007\/978-3-319-44778-0_23"},{"key":"742_CR110","doi-asserted-by":"crossref","unstructured":"Sommer F, Fouss F, Saerens M (2017) Modularity-driven kernel k-means for community detection. In: Proceedings of the international conference on artificial neural networks (ICANN 2017). Lecture notes in computer science, vol 10614. Springer, pp 423\u2013433","DOI":"10.1007\/978-3-319-68612-7_48"},{"key":"742_CR111","unstructured":"Strehl A, Ghosh J (2002) Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3:583\u2013617"},{"key":"742_CR112","doi-asserted-by":"crossref","unstructured":"Tang L, Liu H (2009a) 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","DOI":"10.1145\/1557019.1557109"},{"key":"742_CR113","doi-asserted-by":"crossref","unstructured":"Tang L, Liu H (2009b) 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":"742_CR114","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","journal-title":"IEEE Intell Syst"},{"key":"742_CR115","volume-title":"An introduction to stochastic modeling","author":"HM Taylor","year":"1998","unstructured":"Taylor HM, Karlin S (1998) An introduction to stochastic modeling, 3rd edn. Academic Press, Cambridge","edition":"3"},{"key":"742_CR116","doi-asserted-by":"publisher","DOI":"10.1108\/S1876-0562(2004)04","volume-title":"Link analysis: an information science approach","author":"M Thelwall","year":"2004","unstructured":"Thelwall M (2004) Link analysis: an information science approach. Elsevier, Amsterdam"},{"key":"742_CR117","doi-asserted-by":"crossref","unstructured":"Theodorou EA, Todorov E (2012) Relative entropy and free energy dualities: connections to path integral and KL control. In: Proceedings of the 51st IEEE conference on decision and control (CDC 2012). IEEE, pp 1466\u20131473","DOI":"10.1109\/CDC.2012.6426381"},{"key":"742_CR118","unstructured":"Theodorou EA, Krishnamurthy D, Todorov E (2013) From information theoretic dualities to path integral and Kullback\u2013Leibler control: continuous and discrete time formulations. In: The sixteenth yale workshop on adaptive and learning systems"},{"key":"742_CR119","doi-asserted-by":"crossref","unstructured":"Todorov E (2007) Linearly-solvable Markov decision problems. In: Advances in neural information processing systems 19 (NIPS 2006). MIT Press, pp 1369\u20131375","DOI":"10.7551\/mitpress\/7503.003.0176"},{"key":"742_CR120","doi-asserted-by":"crossref","unstructured":"Todorov E (2008) General duality between optimal control and estimation. In: Proceedings of 47th IEEE conference on decision and control (CDC\u201908), pp 4286\u20134292","DOI":"10.1109\/CDC.2008.4739438"},{"issue":"2","key":"742_CR121","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.1103\/PhysRevE.58.1442","volume":"58","author":"C Tsallis","year":"1998","unstructured":"Tsallis C (1998) Generalized entropy-based criterion for consistent testing. Phys Rev E 58(2):1442","journal-title":"Phys Rev E"},{"key":"742_CR122","volume-title":"Introduction to nonextensive statistical mechanics","author":"C Tsallis","year":"2009","unstructured":"Tsallis C (2009) Introduction to nonextensive statistical mechanics. Springer, Berlin"},{"key":"742_CR123","unstructured":"von Luxburg U, Radl A, Hein M (2010) Getting lost in space: large sample analysis of the commute distance. In: Advances in neural information processing systems 23: proceedings of the NIPS \u201910 conference, pp 2622\u20132630"},{"key":"742_CR124","first-page":"1751","volume":"15","author":"U von Luxburg","year":"2014","unstructured":"von Luxburg U, Radl A, Hein M (2014) Hitting and commute times in large random neighborhood graphs. J Mach Learn Res 15:1751\u20131798","journal-title":"J Mach Learn Res"},{"key":"742_CR125","unstructured":"Wang W, Carreira-Perpinan M (2013) Projection onto the probability simplex: an efficient algorithm with a simple proof, and an application. ArXiv preprint arXiv:1309.1541 [csLG]"},{"key":"742_CR126","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge"},{"issue":"6","key":"742_CR127","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1(6):80\u201383","journal-title":"Biom Bull"},{"key":"742_CR128","doi-asserted-by":"crossref","unstructured":"Yen L, Fouss F, Decaestecker C, Francq P, Saerens M (2007) Graph nodes clustering based on the commute-time kernel. In: Proceedings of the 11th Pacific-Asia conference on knowledge discovery and data mining (PAKDD\u201907). Lecture notes in artificial intelligence, vol 4426. Springer, pp 1037\u20131045","DOI":"10.1007\/978-3-540-71701-0_117"},{"key":"742_CR129","doi-asserted-by":"crossref","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","DOI":"10.1145\/1401890.1401984"},{"issue":"3","key":"742_CR130","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","journal-title":"Data Knowl Eng"},{"issue":"4","key":"742_CR131","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":"742_CR132","doi-asserted-by":"crossref","unstructured":"Zhang D, Mao R (2008a) Classifying networked entities with modularity kernels. In: Proceedings of the 17th ACM conference on information and knowledge management (CIKM 2008). ACM, pp 113\u2013122","DOI":"10.1145\/1458082.1458100"},{"key":"742_CR133","unstructured":"Zhang D, Mao R (2008b) A new kernel for classification of networked entities. In: Proceedings of 6th international workshop on mining and learning with graphs, Helsinki, Finland"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00742-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-021-00742-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00742-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T16:15:35Z","timestamp":1697991335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-021-00742-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,6]]},"references-count":133,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["742"],"URL":"https:\/\/doi.org\/10.1007\/s10618-021-00742-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2021,3,6]]},"assertion":[{"value":"7 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}