François Fouss
François Fouss
UCLouvain: LSM & LouRIM
Verified email at uclouvain.be
Title
Cited by
Cited by
Year
Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation
F Fouss, A Pirotte, JM Renders, M Saerens
IEEE Transactions on knowledge and data engineering 19 (3), 355-369, 2007
13542007
The principal components analysis of a graph, and its relationships to spectral clustering
M Saerens, F Fouss, L Yen, P Dupont
European conference on machine learning, 371-383, 2004
3022004
An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
F Fouss, K Francoisse, L Yen, A Pirotte, M Saerens
Neural networks 31, 53-72, 2012
1422012
An experimental investigation of graph kernels on a collaborative recommendation task
F Fouss, L Yen, A Pirotte, M Saerens
Sixth International Conference on Data Mining (ICDM'06), 863-868, 2006
1282006
clustering using a random walk based distance measure.
L Yen, D Vanvyve, F Wouters, F Fouss, M Verleysen, M Saerens
ESANN, 317-324, 2005
1222005
A novel way of computing similarities between nodes of a graph, with application to collaborative recommendation
F Fouss, A Pirotte, M Saerens
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05 …, 2005
1012005
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
L Yen, F Fouss, C Decaestecker, P Francq, M Saerens
Data & Knowledge Engineering 68 (3), 338-361, 2009
992009
Randomized shortest-path problems: Two related models
M Saerens, Y Achbany, F Fouss, L Yen
Neural Computation 21 (8), 2363-2404, 2009
972009
Algorithms and models for network data and link analysis
F Fouss, M Saerens, M Shimbo
Cambridge University Press, 2016
912016
Graph nodes clustering based on the commute-time kernel
L Yen, F Fouss, C Decaestecker, P Francq, M Saerens
Pacific-Asia Conference on Knowledge Discovery and Data Mining, 1037-1045, 2007
902007
A probabilistic reputation model based on transaction ratings
F Fouss, Y Achbany, M Saerens
Information Sciences 180 (11), 2095-2123, 2010
542010
Evaluating performance of recommender systems: An experimental comparison
F Fouss, M Saerens
2008 IEEE/WIC/ACM International Conference on Web Intelligence and …, 2008
492008
A novel way of computing dissimilarities between nodes of a graph, with application to collaborative filtering and subspace projection of the graph nodes
F Fouss, A Pirotte, JM Renders, M Saerens
Technical Report, Tech. Rep., 2006
392006
Yet another method for combining classifiers outputs: a maximum entropy approach
M Saerens, F Fouss
International Workshop on Multiple Classifier Systems, 82-91, 2004
372004
Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy
Y Achbany, F Fouss, L Yen, A Pirotte, M Saerens
Neurocomputing 71 (13-15), 2507-2520, 2008
322008
Optimal tuning of continual online exploration in reinforcement learning
Y Achbany, F Fouss, L Yen, A Pirotte, M Saerens
International Conference on Artificial Neural Networks, 790-800, 2006
322006
Continually learning optimal allocations of services to tasks
Y Achbany, IJ Jureta, S Faulkner, F Fouss
IEEE Transactions on Services Computing 1 (3), 141-154, 2008
232008
A link analysis extension of correspondence analysis for mining relational databases
L Yen, M Saerens, F Fouss
IEEE Transactions on Knowledge and Data Engineering 23 (4), 481-495, 2010
202010
A sum-over-paths extension of edit distances accounting for all sequence alignments
S García-Díez, F Fouss, M Shimbo, M Saerens
Pattern Recognition 44 (6), 1172-1182, 2011
182011
Comparison of graph node distances on clustering tasks
F Sommer, F Fouss, M Saerens
International Conference on Artificial Neural Networks, 192-201, 2016
172016
The system can't perform the operation now. Try again later.
Articles 1–20