Sylvain Courtain
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sylvain Courtain has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Marco Saerens
ICTEAM, Universite Catholique de Louvain, Ottignies-Louvain-la-Neuve, Belgium
4 shared publications - Guillaume Guex
Univ Lausanne, SLI, Lausanne, Switzerland
3 shared publications - Ilkka Kivimäki
Department of Computer Science, Aalto University, Aalto, Finland
2 shared publications Marco Saerens
2 shared publications- Pierre Leleux
Catholic Univ Louvain, LouRIM, Louvain, Belgium
2 shared publications Kevin Françoisse
1 shared publication
Latest Publications
- Open Access
- 27 June 2025
- Published by Cantonal and University Library Fribourg in Cahiers du Centre de Linguistique et des Sciences du Langage
- No. 69,p. 37-56
A bag-of-paths graph framework with Poisson-distributed path lengths
This paper investigates a theoretical extension of the entropyregularized least-cost problem on a graph from a bag-of-paths perspective. This extension constrains the a priori probability distribution on the length of the paths in order to follow a Poisson distribution. Therefore, this framework allows us to weigh the global impact of path lengths, depending on the structure of the graph, which proves useful in node classification and clustering problems. Accordingly, a novel distance measure between nodes of the graph can be defined from the probability of drawing an i-j path derived from the new bag-ofpaths model. Experiments on supervised classification problems show that the proposed distance is competitive with other state-of-the-artdistances and kernels on a graph.
- 27 June 2025
- Published by Cantonal and University Library Fribourg in Cahiers du Centre de Linguistique et des Sciences du Langage
- No. 69,p. 37-56
Open AccessA bag-of-paths graph framework with Poisson-distributed path lengths
This paper investigates a theoretical extension of the entropyregularized least-cost problem on a graph from a bag-of-paths perspective. This extension constrains the a priori probability distribution on the length of the paths in order to follow a Poisson distribution. Therefore, this framework allows us to weigh the global impact of path lengths, depending on the structure of the graph, which proves useful in node classification and clustering problems. Accordingly, a novel distance measure between nodes of the graph can be defined from the probability of drawing an i-j path derived from the new bag-ofpaths model. Experiments on supervised classification problems show that the proposed distance is competitive with other state-of-the-artdistances and kernels on a graph.
- 23 December 2022
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 14 (4) , 1365-1390
Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison
- 23 December 2022
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 14 (4) , 1365-1390
Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison
- 1 March 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 590
Design of biased random walks on a graph with application to collaborative recommendation
- 1 March 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 590
Design of biased random walks on a graph with application to collaborative recommendation
- 1 January 2022
- Published by Springer Nature
- p. 220-233
A Simple Extension of the Bag-of-Paths Model Weighting Path Lengths by a Poisson Distribution
- 1 January 2022
- Published by Springer Nature
- p. 220-233
A Simple Extension of the Bag-of-Paths Model Weighting Path Lengths by a Poisson Distribution
- 1 May 2021
- Published by Elsevier in Information Sciences
- Vol. 556, 341-360
Randomized shortest paths with net flows and capacity constraints
- 1 May 2021
- Published by Elsevier in Information Sciences
- Vol. 556, 341-360
Randomized shortest paths with net flows and capacity constraints
- 6 March 2021
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 35 (3) , 986-1031
Sparse randomized shortest paths routing with Tsallis divergence regularization
- 6 March 2021
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 35 (3) , 986-1031
Sparse randomized shortest paths routing with Tsallis divergence regularization