#### Filter Results:

- Full text PDF available (31)

#### Publication Year

2003

2018

- This year (3)
- Last 5 years (9)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- François Fouss, Alain Pirotte, Jean-Michel Renders, Marco Saerens
- IEEE Transactions on Knowledge and Data…
- 2007

This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted and undirected graph. It is based on a Markov-chain model… (More)

- Marco Saerens, François Fouss, Luh Yen, Pierre Dupont
- ECML
- 2004

This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspace projection of… (More)

- François Fouss, Kevin Françoisse, Luh Yen, Alain Pirotte, Marco Saerens
- Neural Networks
- 2012

This paper presents a survey as well as an empirical comparison and evaluation of seven kernels on graphs and two related similarity matrices, that we globally refer to as "kernels on graphs" for… (More)

- François Fouss, Alain Pirotte, Marco Saerens
- The 2005 IEEE/WIC/ACM International Conference on…
- 2005

This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a Markov-chain model of… (More)

This work presents some general procedures for computing dissimilarities between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a Markov-chain model… (More)

- François Fouss, Luh Yen, Alain Pirotte, Marco Saerens
- Sixth International Conference on Data Mining…
- 2006

This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the von Neumann kernel,… (More)

This work proposes a simple way to improve a clustering algorithm. The idea is to exploit a new distance metric called the “Euclidian Commute Time” (ECT) distance, based on a random walk model on a… (More)

This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel (KCT), providing a… (More)

- François Fouss, Marco Saerens
- 2008 IEEE/WIC/ACM International Conference on Web…
- 2008

Much early evaluation work focused specifically on the "accuracy" of recommendation algorithms. Good recommendation (in terms of accuracy) has, however, to be coupled with other considerations. This… (More)

This work presents a new perspective on characterizing the similarity be-<lb>tween elements of a database or, more generally, nodes of a weighted, undi-<lb>rected, graph. It is based on a… (More)