activity
20122022
most citedData for Development: the D4D Challenge on Mobile Phone Data

157 citations · 179 across the 9 of their papers we have counts for

collaborators

9 papers

cs.LG2022★ 1 cited

Co-clustering based exploratory analysis of mixed-type data tables

Aichetou Bouchareb, Marc Boullé, Fabrice Clérot +1

Co-clustering is a class of unsupervised data analysis techniques that extract the existing underlying dependency structure between the instances and variables of a data table as h…

cs.LG2022

Model Based Co-clustering of Mixed Numerical and Binary Data

Aichetou Bouchareb, Marc Boullé, Fabrice Clérot +1

Co-clustering is a data mining technique used to extract the underlying block structure between the rows and columns of a data matrix. Many approaches have been studied and have sh…

cs.IT2016★ 1 cited

Revisiting enumerative two-part crude MDL for Bernoulli and multinomial distributions (Extended version)

Marc Boullé, Fabrice Clérot, Carine Hue

We leverage the Minimum Description Length (MDL) principle as a model selection technique for Bernoulli distributions and compare several types of MDL codes. We first present a sim…

cs.LG2016★ 9 cited

A Relative Exponential Weighing Algorithm for Adversarial Utility-based Dueling Bandits

Pratik Gajane, Tanguy Urvoy, Fabrice Clérot

We study the K-armed dueling bandit problem which is a variation of the classical Multi-Armed Bandit (MAB) problem in which the learner receives only relative feedback about the se…

cs.DB2015

Cats & Co: Categorical Time Series Coclustering

Dominique Gay, Romain Guigourès, Marc Boullé +1

We suggest a novel method of clustering and exploratory analysis of temporal event sequences data (also known as categorical time series) based on three-dimensional data grid model…

cs.LG2015

Random Forest for the Contextual Bandit Problem - extended version

Raphaël Féraud, Robin Allesiardo, Tanguy Urvoy +1

To address the contextual bandit problem, we propose an online random forest algorithm. The analysis of the proposed algorithm is based on the sample complexity needed to find the…

cs.DB2015★ 2 cited

Country-scale Exploratory Analysis of Call Detail Records through the Lens of Data Grid Models

Romain Guigourès, Dominique Gay, Marc Boullé +2

Call Detail Records (CDRs) are data recorded by telecommunications companies, consisting of basic informations related to several dimensions of the calls made through the network:…

cs.CY2012★ 157 cited

Data for Development: the D4D Challenge on Mobile Phone Data

Vincent D. Blondel, Markus Esch, Connie Chan +6

The Orange "Data for Development" (D4D) challenge is an open data challenge on anonymous call patterns of Orange's mobile phone users in Ivory Coast. The goal of the challenge is t…

cs.IR2012★ 9 cited

Toward a New Protocol to Evaluate Recommender Systems

Frank Meyer, Françoise Fessant, Fabrice Clérot +1

In this paper, we propose an approach to analyze the performance and the added value of automatic recommender systems in an industrial context. We show that recommender systems are…