Randomized shortest paths with net flows and capacity constraints S Courtain, P Leleux, I Kivimäki, G Guex, M Saerens Information Sciences 556, 341-360, 2021 | 14 | 2021 |
Graph-based fraud detection with the free energy distance S Courtain, B Lebichot, I Kivimäki, M Saerens Complex Networks and Their Applications VIII: Volume 2 Proceedings of the …, 2020 | 12 | 2020 |
Sparse randomized shortest paths routing with Tsallis divergence regularization P Leleux, S Courtain, G Guex, M Saerens Data Mining and Knowledge Discovery 35, 986-1031, 2021 | 9 | 2021 |
Covariance and correlation measures on a graph in a generalized bag-of-paths formalism G Guex, S Courtain, M Saerens Journal of Complex Networks 8 (6), cnaa026, 2020 | 7 | 2020 |
Design of biased random walks on a graph with application to collaborative recommendation P Leleux, S Courtain, K Françoisse, M Saerens Physica A: Statistical Mechanics and its Applications 590, 126752, 2022 | 5 | 2022 |
Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison S Courtain, G Guex, I Kivimäki, M Saerens International Journal of Machine Learning and Cybernetics 14 (4), 1365-1390, 2023 | 3 | 2023 |
Essays on network data analysis through the bag-of-paths framework S Courtain UCL-Université Catholique de Louvain, 2022 | 2 | 2022 |
A Simple Extension of the Bag-of-Paths Model Weighting Path Lengths by a Poisson Distribution S Courtain, M Saerens Complex Networks & Their Applications X: Volume 1, Proceedings of the Tenth …, 2022 | 2 | 2022 |
Community detection in networks by soft modularity maximization: A new approach and empirical comparisons S Courtain, M Saerens Master’s thesis, Louvain School of Management, 2017 | 2 | 2017 |
Maximum entropy logistic regression for demographic parity in supervised classification F Vancompernolle Vromman, S Courtain, P Leleux, C de Schaetzen, ... | | 2023 |
Maximum Entropy Logistic Regression for Demographic Parity in Supervised Classification FV Vromman, S Courtain, P Leleux, C de Schaetzen, E Beghein, A Kneip, ... | | |
A comparison of randomized optimal flow algorithms versus standard optimal flow algorithms W Visée, M Saerens, S Courtain | | |
An empirical study of graph nodes clustering with the p-resistance HY Hu, M Saerens, S Courtain | | |
The impact of graph mining features on churn prediction in the telecommunication industry R Hautecourt, B Lebichot, S Courtain | | |