default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Fouss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Chloe Satinet
, François Fouss, Marco Saerens, Pierre Leleux:
In-processing and post-processing strategies for balancing accuracy and sustainability in product recommendations. Electron. Commer. Res. Appl. 67: 101433 (2024)- 2021
- [j13]François Fouss, Elora Fernandes:
A Closer-to-Reality Model for Comparing Relevant Dimensions of Recommender Systems, with Application to Novelty. Inf. 12(12): 500 (2021) - [c20]Flore Vancompernolle Vromman, François Fouss:
Filter bubbles created by collaborative filtering algorithms themselves, fact or fiction? An experimental comparison. WI/IAT (Workshop/Special Session) 2021: 153-159
2010 – 2019
- 2018
- [j12]Fabian Lecron, François Fouss:
An optimization model for collaborative recommendation using a covariance-based regularizer. Data Min. Knowl. Discov. 32(3): 651-674 (2018) - 2017
- [c19]Felix Sommer, François Fouss, Marco Saerens:
Modularity-Driven Kernel k-means for Community Detection. ICANN (2) 2017: 423-433 - [c18]Felix Sommer, Fabian Lecron, François Fouss:
Recommender systems: the case of repeated interaction in matrix factorization. WI 2017: 843-847 - 2016
- [c17]Felix Sommer, François Fouss, Marco Saerens:
Comparison of Graph Node Distances on Clustering Tasks. ICANN (1) 2016: 192-201 - 2014
- [j11]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. IEEE Trans. Pattern Anal. Mach. Intell. 36(6): 1268-1274 (2014) - [c16]François Fouss, Clémentine Van Parijs:
Improving accuracy by reducing the importance of hubs in nearest-neighbor recommendations. ESANN 2014 - [c15]Mathieu Senelle, Marco Saerens, François Fouss:
The Sum-over-Forests clustering. ESANN 2014 - 2013
- [j10]Kevin Françoisse, François Fouss, Marco Saerens:
A link-analysis-based discriminant analysis for exploring partially labeled graphs. Pattern Recognit. Lett. 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
- [j9]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
- [j8]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 Recognit. 44(6): 1172-1182 (2011) - [j7]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
- [j6]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
2000 – 2009
- 2009
- [j5]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) - [j4]Marco Saerens, Youssef Achbany, François Fouss, Luh Yen:
Randomized Shortest-Path Problems: Two Related Models. Neural Comput. 21(8): 2363-2404 (2009) - 2008
- [j3]Youssef Achbany, François Fouss, Luh Yen, Alain Pirotte, Marco Saerens:
Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy. Neurocomputing 71(13-15): 2507-2520 (2008) - [j2]Youssef Achbany, Ivan Jureta, Stéphane Faulkner, François Fouss:
Continually Learning Optimal Allocations of Services to Tasks. IEEE Trans. Serv. Comput. 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
- [b1]François Fouss:
Measures of similarity on graphs : Investigation and application to collaborative recommendation. Catholic University of Louvain, Louvain-la-Neuve, Belgium, 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
