#### Filter Results:

#### Publication Year

2004

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

LSHTC is a series of challenges which aims to assess the performance of classification systems in large-scale classification in a a large number of classes (up to hundreds of thousands). This paper describes the dataset that have been released along the LSHTC series. The paper details the construction of the datsets and the design of the tracks as well as… (More)

- Edric Hartland, Sylvain Gelly, Nicolas Baskiotis, Olivier Teytaud, Michéle Sebag
- 2006

This article provides an overview of the first BioASQ challenge, a competition on large-scale biomedical semantic indexing and question answering (QA), which took place between March and September 2013. BioASQ assesses the ability of systems to semantically index very large numbers of biomedical scientific articles, and to return concise and… (More)

- Cédric Hartland, Nicolas Baskiotis, Sylvain Gelly, Olivier Teytaud, Michèle Sebag
- 2007

Motivated by realtime website optimization, this paper is about on-line learning in abruptly changing environments. Two extensions of the UCBT algorithm are combined in order to handle dynamic multi-armed bandits, and specifically to cope with fast variations in the rewards. Firstly, a change point detection test based on Page-Hinkley statistics is used to… (More)

Some Statistical Software Testing approaches rely on sampling the feasible paths in the control flow graph of the program; the difficulty comes from the tiny ratio of feasible paths. This paper presents an adaptive sampling mechanism called EXIST for Ex-ploration/eXploitation Inference for Software Testing , able to retrieve distinct feasible paths with… (More)

We consider the problem of discovering links of an evolving undirected graph given a series of past snapshots of that graph. The graph is observed through the time sequence of its adjacency matrix and only the presence of edges is observed. The absence of an edge on a certain snapshot cannot be distinguished from a missing entry in the adjacency matrix.… (More)

How to determine <i>a priori</i> whether a learning algorithm is suited to a learning problem instance is a major scientific and technological challenge. A first step toward this goal, inspired by the Phase Transition (PT) paradigm developed in the Constraint Satisfaction domain, is presented in this paper.Based on the PT paradigm, extensive and principled… (More)

Motivated by Structural Statistical Software Testing (SSST), this paper is interested in sampling the feasible execution paths in the control flow graph of the program being tested. For some complex programs , the fraction of feasible paths becomes tiny, ranging in [10 −10 , 10 −5 ]. When relying on the uniform sampling of the program paths, SSST is thus… (More)