François Fouss

Orcid: 0000-0001-6383-9514

According to our database1, François Fouss authored at least 34 papers between 2003 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
A Closer-to-Reality Model for Comparing Relevant Dimensions of Recommender Systems, with Application to Novelty.
Inf., 2021

Filter bubbles created by collaborative filtering algorithms themselves, fact or fiction? An experimental comparison.
Proceedings of the WI-IAT '21: IEEE/WIC/ACM International Conference on Web Intelligence, Hybrid Event / Melbourne, VIC, Australia, December 14 - 17, 2021, 2021

2018
An optimization model for collaborative recommendation using a covariance-based regularizer.
Data Min. Knowl. Discov., 2018

2017
Recommender systems: the case of repeated interaction in matrix factorization.
Proceedings of the International Conference on Web Intelligence, 2017

Modularity-Driven Kernel k-means for Community Detection.
Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2017, 2017

2016
Comparison of Graph Node Distances on Clustering Tasks.
Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2016, 2016

2014
The Sum-over-Forests Density Index: Identifying Dense Regions in a Graph.
IEEE Trans. Pattern Anal. Mach. Intell., 2014

The Sum-over-Forests clustering.
Proceedings of the 22th European Symposium on Artificial Neural Networks, 2014

Improving accuracy by reducing the importance of hubs in nearest-neighbor recommendations.
Proceedings of the 22th European Symposium on Artificial Neural Networks, 2014

2013
A link-analysis-based discriminant analysis for exploring partially labeled graphs.
Pattern Recognit. Lett., 2013

2012
An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification.
Neural Networks, 2012

2011
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases.
IEEE Trans. Knowl. Data Eng., 2011

A sum-over-paths extension of edit distances accounting for all sequence alignments.
Pattern Recognit., 2011

A simple-cycles weighted kernel based on harmony structure for similarity retrieval.
Proceedings of the 12th International Society for Music Information Retrieval Conference, 2011

2010
A probabilistic reputation model based on transaction ratings.
Inf. Sci., 2010

Normalized Sum-over-Paths Edit Distances.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

2009
Randomized Shortest-Path Problems: Two Related Models.
Neural Comput., 2009

Graph nodes clustering with the sigmoid commute-time kernel: A comparative study.
Data Knowl. Eng., 2009

2008
Continually Learning Optimal Allocations of Services to Tasks.
IEEE Trans. Serv. Comput., 2008

Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy.
Neurocomputing, 2008

Evaluating Performance of Recommender Systems: An Experimental Comparison.
Proceedings of the 2008 IEEE / WIC / ACM International Conference on Web Intelligence, 2008

A Framework for QoS Driven Selection of Services.
Proceedings of the 2008 IEEE International Conference on Services Computing (SCC 2008), 2008

2007
Measures of similarity on graphs : Investigation and application to collaborative recommendation.
PhD thesis, 2007

Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation.
IEEE Trans. Knowl. Data Eng., 2007

Graph Nodes Clustering Based on the Commute-Time Kernel.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2007

2006
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task.
Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

Optimal Tuning of Continual Online Exploration in Reinforcement Learning.
Proceedings of the Artificial Neural Networks, 2006

2005
HITS is Principal Components Analysis.
Proceedings of the 2005 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2005), 2005

A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation.
Proceedings of the 2005 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2005), 2005

Web Recommendation System Based on a Markov-Chainmodel.
Proceedings of the ICEIS 2005, 2005

clustering using a random walk based distance measure.
Proceedings of the 13th European Symposium on Artificial Neural Networks, 2005

2004
Yet Another Method for Combining Classifiers Outputs: A Maximum Entropy Approach.
Proceedings of the Multiple Classifier Systems, 5th International Workshop, 2004

The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering.
Proceedings of the Machine Learning: ECML 2004, 2004

2003
Links Between Kleinberg's Hubs and Authorities, Correspondence Analysis, and Markov Chains.
Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003


  Loading...