Sparse randomized shortest paths routing with Tsallis divergence regularization
From MaRDI portal
Publication:2036747
DOI10.1007/s10618-021-00742-yzbMath1473.90050arXiv2007.00419OpenAlexW3135613777MaRDI QIDQ2036747
Marco Saerens, Pierre Leleux, Sylvain Courtain, Guillaume Guex
Publication date: 30 June 2021
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.00419
Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15) Random walks on graphs (05C81) Computational aspects of data analysis and big data (68T09)
Related Items
A simple extension of the bag-of-paths model weighting path lengths by a Poisson distribution ⋮ Dissecting graph measure performance for node clustering in LFR parameter space
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast projection onto the simplex and the \(l_1\) ball
- Optimal control as a graphical model inference problem
- The walk distances in graphs
- Statistics for high-dimensional data. Methods, theory and applications.
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- A sum-over-paths extension of edit distances accounting for all sequence alignments
- Algorithms for fuzzy clustering. Methods in \(c\)-means clustering with applications
- Statistical analysis of network data. Methods and models
- The matrix-forest theorem and measuring relations in small social groups
- Modern multidimensional scaling: theory and applications
- Time bounds for selection
- Possibilistic and probabilistic fuzzy clustering: Unification within the framework of the non-extensive thermostatistics
- Interpolating between random walks and optimal transportation routes: flow with multiple sources and targets
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- On proximity measures for graph vertices
- A bag-of-paths framework for network data analysis
- Linear and nonlinear programming
- Data science, learning by latent structures, and knowledge discovery.
- Network analysis. Methodological foundations.
- A new status index derived from sociometric analysis
- Machine Learning in Complex Networks
- Hitting and commute times in large graphs are often misleading
- Introduction to Nonlinear Optimization
- Trading Value and Information in MDPs
- Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering?
- Information Theory and Statistical Mechanics
- Introduction to Nonextensive Statistical Mechanics
- Introduction to Information Retrieval
- Decomposition of Path Choice Entropy in General Transport Networks
- Markov Chains
- Community structure in social and biological networks
- Networks
- Ordinary Differential Equation Methods for Markov Decision Processes and Application to Kullback--Leibler Control Cost
- 10.1162/153244303321897735
- Randomized Shortest-Path Problems: Two Related Models
- Studying New Classes of Graph Metrics
- Elements of Information Theory
- STACS 2005
- Network Science
