| 2013 | ||
|---|---|---|
| j9 | Kevin Françoisse, François Fouss, Marco Saerens: A link-analysis-based discriminant analysis for exploring partially labeled graphs. Pattern Recognition Letters 34(2): 146-154 (2013) | |
| i1 | Mathieu Senelle, Silvia García-Díez, Amin Mantrach, Masashi Shimbo, Marco Saerens, François Fouss: The Sum-over-Forests density index: identifying dense regions in a graph. CoRR abs/1301.0725 (2013) | |
| 2012 | ||
| j8 | François Fouss, Kevin Françoisse, Luh Yen, Alain Pirotte, Marco Saerens: An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural Networks 31: 53-72 (2012) | |
| 2011 | ||
| j7 | Silvia García-Díez, François Fouss, Masashi Shimbo, Marco Saerens: A sum-over-paths extension of edit distances accounting for all sequence alignments. Pattern Recognition 44(6): 1172-1182 (2011) | |
| j6 | Luh Yen, Marco Saerens, François Fouss: A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases. IEEE Trans. Knowl. Data Eng. 23(4): 481-495 (2011) | |
| c14 | Silvia García-Díez, Marco Saerens, Mathieu Senelle, François Fouss: A simple-cycles weighted kernel based on harmony structure for similarity retrieval. ISMIR 2011: 61-66 | |
| 2010 | ||
| j5 | François Fouss, Youssef Achbany, Marco Saerens: A probabilistic reputation model based on transaction ratings. Inf. Sci. 180(11): 2095-2123 (2010) | |
| c13 | Silvia García-Díez, François Fouss, Masashi Shimbo, Marco Saerens: Normalized Sum-over-Paths Edit Distances. ICPR 2010: 1044-1047 | |
| 2009 | ||
| j4 | 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) | |
| j3 | Marco Saerens, Youssef Achbany, François Fouss, Luh Yen: Randomized Shortest-Path Problems: Two Related Models. Neural Computation 21(8): 2363-2404 (2009) | |
| 2008 | ||
| j2 | Youssef Achbany, Ivan Jureta, Stéphane Faulkner, François Fouss: Continually Learning Optimal Allocations of Services to Tasks. IEEE T. Services Computing 1(3): 141-154 (2008) | |
| c12 | Caroline Herssens, Stéphane Faulkner, François Fouss, Ivan Jureta: A Framework for QoS Driven Selection of Services. IEEE SCC (2) 2008: 537-538 | |
| c11 | François Fouss, Marco Saerens: Evaluating Performance of Recommender Systems: An Experimental Comparison. Web Intelligence 2008: 735-738 | |
| 2007 | ||
| j1 | François Fouss, Alain Pirotte, Jean-Michel Renders, Marco Saerens: Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation. IEEE Trans. Knowl. Data Eng. 19(3): 355-369 (2007) | |
| c10 | 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 | ||
| c9 | 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 | |
| c8 | 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 | ||
| c7 | 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 | |
| c6 | François Fouss, Stéphane Faulkner, Manuel Kolp, Alain Pirotte, Marco Saerens: Web Recommendation System Based on a Markov-Chainmodel. ICEIS (4) 2005: 56-63 | |
| c5 | François Fouss, Alain Pirotte, Marco Saerens: A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation. Web Intelligence 2005: 550-556 | |
| c4 | Marco Saerens, François Fouss: HITS is Principal Components Analysis. Web Intelligence 2005: 782-785 | |
| 2004 | ||
| c3 | 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 | |
| c2 | Marco Saerens, François Fouss: Yet Another Method for Combining Classifiers Outputs: A Maximum Entropy Approach. Multiple Classifier Systems 2004: 82-91 | |
| 2003 | ||
| c1 | François Fouss, Marco Saerens, Jean-Michel Renders: Links Between Kleinberg's Hubs and Authorities, Correspondence Analysis, and Markov Chains. ICDM 2003: 521-524 | |
Data released under the ODC-BY 1.0 license — See also our legal information page