 | 2009 |
|---|
| 8 |       | Luh Yen,
François Fouss,
Christine Decaestecker,
Pascal Francq,
Marco Saerens:
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study.
Data Knowl. Eng. 68(3): 338-361 (2009) |
| 7 | | Marco Saerens,
Youssef Achbany,
François Fouss,
Luh Yen:
Randomized Shortest-Path Problems: Two Related Models.
Neural Computation 21(8): 2363-2404 (2009) |
| 2008 |
|---|
| 6 | | Luh Yen,
Marco Saerens,
Amin Mantrach,
Masashi Shimbo:
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances.
KDD 2008: 785-793 |
| 2007 |
|---|
| 5 | | Luh Yen,
François Fouss,
Christine Decaestecker,
Pascal Francq,
Marco Saerens:
Graph Nodes Clustering Based on the Commute-Time Kernel.
PAKDD 2007: 1037-1045 |
| 2006 |
|---|
| 4 | | Youssef Achbany,
François Fouss,
Luh Yen,
Alain Pirotte,
Marco Saerens:
Optimal Tuning of Continual Online Exploration in Reinforcement Learning.
ICANN (1) 2006: 790-800 |
| 3 | | François Fouss,
Luh Yen,
Alain Pirotte,
Marco Saerens:
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task.
ICDM 2006: 863-868 |
| 2005 |
|---|
| 2 | | Luh Yen,
Denis Vanvyve,
Fabien Wouters,
François Fouss,
Michel Verleysen,
Marco Saerens:
clustering using a random walk based distance measure.
ESANN 2005: 317-324 |
| 2004 |
|---|
| 1 | | Marco Saerens,
François Fouss,
Luh Yen,
Pierre Dupont:
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering.
ECML 2004: 371-383 |
