Fabien Gandon

Fabien Gandon

orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2004 in Journal of Web Semantics
Verified
Journal Article
Closed access
FGFabien Gandon
Fabien Gandon
NSNorman M Sadeh
Norman M Sadeh

29 February 2008 in Journal of Web Semantics
Verified
Journal Article
Closed access
MBMichel Buffa
Michel Buffa
FGFabien Gandon
Fabien Gandon
GEGuillaume Ereteo
Guillaume Ereteo
PSPeter Sander
Peter Sander
CFCatherine Faron-Zucker
Catherine Faron-Zucker

13 March 2017
Verified
Conference Paper
Open access
EPEmilie Palagi
Emilie Palagi
FGFabien Gandon
Fabien Gandon
AGAlain Giboin
Alain Giboin
RTRaphael Troncy
Raphael Troncy
International audienceExploratory search has an unclear and open-ended definition. The complexity of the task and the difficulty of defining this activity are reflected in the limits of existing evaluation methods for exploratory search systems. In order to improve them, we intend to design an evaluation method based on a user-centered model of exploratory search. In this work, we identified and defined the characteristics of exploratory search and used them as an information seeking model evaluation grid. We tested this analytic grid on two information seeking models: Ellis' and Marchionini's models. The results show that Marchonini's model does not match our evaluation method's requirements whereas on the other hand Ellis' model could be adapted to better suit exploratory search

1 January 2009
Verified
Book Chapter
Closed access
PDF file
GEGuillaume Erétéo
Guillaume Erétéo
MBMichel Buffa
Michel Buffa
FGFabien Gandon
Fabien Gandon
OCOlivier Corby
Olivier Corby

13 February 2017 in IEEE Intelligent Systems
Verified
Journal Article
Closed access
LILuis-Daniel Ibanez
Luis-Daniel Ibanez
ESElena Simperl
Elena Simperl
FGFabien Gandon
Fabien Gandon
HSHenry Story
Henry Story
The web was originally conceived as decentralized and universal, but during its popularization, its big value was built on centralized servers and nonuniversal access. A key element to redecentralize the web is to be able to generate trustable, secure, and accountable updates among autonomous participants without a central server. The authors believe that the marriage between distributed ledgers and linked data can provide this functionality and unlock the web's true potential. As a first step toward it, the authors propose a minimal vocabulary to describe and link distributed ledgers.

1 August 2014
Verified
Conference Paper
Closed access
RHRakebul Hasan
Rakebul Hasan
FGFabien Gandon
Fabien Gandon
In this paper we address the problem of predicting SPARQL query performance. We use machine learning techniques to learn SPARQL query performance from previously executed queries. Traditional approaches for estimating SPARQL query cost are based on statistics about the underlying data. However, in many use-cases involving querying Linked Data, statistics about the underlying data are often missing. Our approach does not require any statistics about the underlying RDF data, which makes it ideal for the Linked Data scenario. We show how to model SPARQL queries as feature vectors, and use k-nearest neighbors regression and Support Vector Machine with the nu-SVR kernel to accurately predict SPARQL query execution time.