Marco Saerens
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marco Saerens has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- François Fouss
Université Catholique de Louvain, Belgium
11 shared publications - Masashi Shimbo
Nara Institute of Science and Technology Ikoma Nara Japan
11 shared publications - Bertrand Lebichot
Catholic Univ Louvain, ICTEAM, Louvain, Belgium
5 shared publications - Guillaume Guex
Univ Lausanne, SLI, Lausanne, Switzerland
4 shared publications - Sylvain Courtain
Université catholique de Louvain
4 shared publications - Pierre Leleux
Catholic Univ Louvain, LouRIM, Louvain, Belgium
3 shared publications
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.
- 19 July 2024
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 92 (5) , 1319-1352
Calibration methods in imbalanced binary classification
- 19 July 2024
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 92 (5) , 1319-1352
Calibration methods in imbalanced binary classification
- 12 June 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 300
Sparse randomized policies for Markov decision processes based on Tsallis divergence regularization
- 12 June 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 300
Sparse randomized policies for Markov decision processes based on Tsallis divergence regularization
- 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 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
- 1 January 2018
- Published by Elsevier in Neurocomputing
- Vol. 275, 224-236
A bag-of-paths node criticality measure
- 1 January 2018
- Published by Elsevier in Neurocomputing
- Vol. 275, 224-236
A bag-of-paths node criticality measure
- Open Access
- 1 June 2017
- Published by Elsevier in Neural Networks
- Vol. 90, 90-111
A bag-of-paths framework for network data analysis
- 1 June 2017
- Published by Elsevier in Neural Networks
- Vol. 90, 90-111
Open AccessA bag-of-paths framework for network data analysis
- Open Access
A Bag-of-Paths Node Criticality Measure
This work compares several node (and network) criticality measures quantifying to which extend each node is critical with respect to the communication flow between nodes of the network, and introduces a new measure based on the Bag-of-Paths (BoP) framework. Network disconnection simulation experiments show that the new BoP measure outperforms all the other measures on a sample of Erdos-Renyi and Albert-Barabasi graphs. Furthermore, a faster (still O(n^3)), approximate, BoP criticality relying on the Sherman-Morrison rank-one update of a matrix is introduced for tackling larger networks. This approximate measure shows similar performances as the original, exact, one.
Open AccessA Bag-of-Paths Node Criticality Measure
This work compares several node (and network) criticality measures quantifying to which extend each node is critical with respect to the communication flow between nodes of the network, and introduces a new measure based on the Bag-of-Paths (BoP) framework. Network disconnection simulation experiments show that the new BoP measure outperforms all the other measures on a sample of Erdos-Renyi and Albert-Barabasi graphs. Furthermore, a faster (still O(n^3)), approximate, BoP criticality relying on the Sherman-Morrison rank-one update of a matrix is introduced for tackling larger networks. This approximate measure shows similar performances as the original, exact, one.
- 30 November 2016
- Published by Springer Nature
- p. 721-733
A graph-based, semi-supervised, credit card fraud detection system
- 30 November 2016
- Published by Springer Nature
- p. 721-733
A graph-based, semi-supervised, credit card fraud detection system