Guillaume Guex
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Guillaume Guex has a total of 8 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 - Pierre Leleux
Catholic Univ Louvain, LouRIM, Louvain, Belgium
3 shared publications - Sylvain Courtain
Université catholique de Louvain
3 shared publications - Ilkka Kivimäki
Department of Computer Science, Aalto University, Aalto, Finland
2 shared publications - Bertrand Lebichot
Catholic Univ Louvain, ICTEAM, Louvain, Belgium
1 shared publication François Bavaud
University of Lausanne
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. 73-96
A framework for spatial clustering of textual objects: applications in topic clustering and text segmentation
We present a general, classical, framework of spatial clustering which can be applied to various textual objects (e.g. character n-grams, words, sentences). This framework proposes to cluster objects according to users defined linguistic similarity, while keeping a spatial coherence of objects among clusters. Two methods are derived from this formalism: SpatialWord, which applies to word-tokens, and SpatialSent, operating on sentences, which both balance between semantic similarities of objects and their position along the textual sequence. We show that these unsupervised methods, along with semi-supervised variants, can perform jointly two operations often achieved individually by methods in literature: (1) the extraction of a desirable number of topics from a document along with list of words to interpret them; and (2) the textual segmentation of the document reflecting these extracted topics. Case studies show that these methods perform competitively against state-of-the-art methods on baseline datasets.
- 27 June 2025
- Published by Cantonal and University Library Fribourg in Cahiers du Centre de Linguistique et des Sciences du Langage
- No. 69,p. 73-96
Open AccessA framework for spatial clustering of textual objects: applications in topic clustering and text segmentation
We present a general, classical, framework of spatial clustering which can be applied to various textual objects (e.g. character n-grams, words, sentences). This framework proposes to cluster objects according to users defined linguistic similarity, while keeping a spatial coherence of objects among clusters. Two methods are derived from this formalism: SpatialWord, which applies to word-tokens, and SpatialSent, operating on sentences, which both balance between semantic similarities of objects and their position along the textual sequence. We show that these unsupervised methods, along with semi-supervised variants, can perform jointly two operations often achieved individually by methods in literature: (1) the extraction of a desirable number of topics from a document along with list of words to interpret them; and (2) the textual segmentation of the document reflecting these extracted topics. Case studies show that these methods perform competitively against state-of-the-art methods on baseline datasets.
- 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
- Open Access
- 7 March 2023
- Published by Springer Nature in Research Square
Estimation of flow trajectories in a multi-linestransportation network
Characterizing a public transportation network, such as an urban networkwith multiple lines, requires the origin-destination trip counts during a givenperiod. Yet, if automatic counting makes the embarkment (boarding) anddisembarkment (alighting) counts in vehicles known, it often happens thatpedestrian transfers between lines are harder to track, and require costly andinvasive devices (e.g., facial recognition system) to be estimated. In thiscontribution, we propose a method, based on maximum entropy andinvolving an iterative fitting procedure, which estimates the passenger flowbetween origins and destinations solely based on embarkment anddisembarkment counts. Moreover, this method is flexible enough to providean adaptable framework in case additional data is known, such as attractionpoles between certain nodes in the network, or percentages of transferringpassengers between some lines. This method is tested on toy examples, aswell as with the data of the public transportation network of the city ofLausanne provided by its Transportation Agency (tl), and gives arguablyconvincing estimations of the transportation flow.
- 7 March 2023
- Published by Springer Nature in Research Square
Open AccessEstimation of flow trajectories in a multi-linestransportation network
Characterizing a public transportation network, such as an urban networkwith multiple lines, requires the origin-destination trip counts during a givenperiod. Yet, if automatic counting makes the embarkment (boarding) anddisembarkment (alighting) counts in vehicles known, it often happens thatpedestrian transfers between lines are harder to track, and require costly andinvasive devices (e.g., facial recognition system) to be estimated. In thiscontribution, we propose a method, based on maximum entropy andinvolving an iterative fitting procedure, which estimates the passenger flowbetween origins and destinations solely based on embarkment anddisembarkment counts. Moreover, this method is flexible enough to providean adaptable framework in case additional data is known, such as attractionpoles between certain nodes in the network, or percentages of transferringpassengers between some lines. This method is tested on toy examples, aswell as with the data of the public transportation network of the city ofLausanne provided by its Transportation Agency (tl), and gives arguablyconvincing estimations of the transportation flow.
- 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 May 2016
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 450, 264-277
Interpolating between random walks and optimal transportation routes: Flow with multiple sources and targets
- 1 May 2016
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 450, 264-277
Interpolating between random walks and optimal transportation routes: Flow with multiple sources and targets
- 1 January 2015
- Published by Springer Nature
- p. 101-111
Flow-Based Dissimilarities: Shortest Path, Commute Time, Max-Flow and Free Energy
- 1 January 2015
- Published by Springer Nature
- p. 101-111
Flow-Based Dissimilarities: Shortest Path, Commute Time, Max-Flow and Free Energy