Nicolas Lachiche

Dr. Nicolas Lachiche

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
27 December 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
FMFernando Martínez-Plumed
Fernando Martínez-Plumed
LCLidia Contreras-Ochando
Lidia Contreras-Ochando
CFCesar Ferri
Cesar Ferri
Jose Hernandez-OralloJose Hernandez-Orallo
Jose Hernandez-Orallo
MKMeelis Kull
Meelis Kull
PFPeter Flach
Peter Flach
CRISP-DM(CRoss-Industry Standard Process for Data Mining) has its origins in the second half of the nineties and is thus about two decades old. According to many surveys and user polls it is still the de facto standard for developing data mining and knowledge discovery projects. However, undoubtedly the field has moved on considerably in twenty years, with data science now the leading term being favoured over data mining. In this paper we investigate whether, and in what contexts, CRISP-DM is still fit for purpose for data science projects. We argue that if the project is goal-directed and process-driven the process model view still largely holds. On the other hand, when data science projects become more exploratory the paths that the project can take become more varied, and a more flexible model is called for. We suggest what the outlines of such a trajectory-based model might look like and how it can be used to categorise data science projects (goal-directed, exploratory or data management). We examine seven real-life exemplars where exploratory activities play an important role and compare them against 51 use cases extracted from the NIST Big Data Public Working Group. We anticipate this categorisation can help project planning in terms of time and cost characteristics.

12 July 2013 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
ASAndre Stumpf
Andre Stumpf
NLNicolas Lachiche
Nicolas Lachiche
Jean-Philippe MaletJean-Philippe Malet
Jean-Philippe Malet
Norman KerleNorman Kerle
Norman Kerle
APAnne PUISSANT
Anne PUISSANT
Active learning (AL) algorithms have been proven useful in reducing the number of required training samples for remote sensing applications; however, most methods query samples pointwise without considering spatial constraints on their distribution. This may often lead to a spatially dispersed distribution of training points unfavorable for visual image interpretation or field surveys. The aim of this study is to develop region-based AL heuristics to guide user attention toward a limited number of compact spatial batches rather than distributed points. The proposed query functions are based on a tree ensemble classifier and combine criteria of sample uncertainty and diversity to select regions of interest. Class imbalance, which is inherent to many remote sensing applications, is addressed through stratified bootstrap sampling. Empirical tests of the proposed methods are performed with multitemporal and multisensor satellite images capturing, in particular, sites recently affected by large-scale landslide events. The assessment includes an experimental evaluation of the labeling time required by the user and the computational runtime, and a sensitivity analysis of the main algorithm parameters. Region-based heuristics that consider sample uncertainty and diversity are found to outperform pointwise sampling and region-based methods that consider only uncertainty. Reference landslide inventories from five different experts enable a detailed assessment of the spatial distribution of remaining errors and the uncertainty of the reference data.

27 May 2011 in Soft Computing
Verified
Journal Article
Closed access
PDF file
OMOgier Maitre
Ogier Maitre
FKFrédéric Krüger
Frédéric Krüger
SQStéphane Querry
Stéphane Querry
NLNicolas Lachiche
Nicolas Lachiche
PCPierre Collet
Pierre Collet

5 May 2022 in IEEE Access
Verified
Journal Article
Open access
HAHajer Akid
Hajer Akid
GFGabriel Frey
Gabriel Frey
MAMounir Ben Ayed
Mounir Ben Ayed
NLNicolas Lachiche
Nicolas Lachiche
Nowadays, the data used for decision-making come from a wide variety of sources which are difficult to manage using relational databases. To address this problem, many researchers have turned to Not only SQL (NoSQL) databases to provide scalability and flexibility for On-Line Analytical Processing (OLAP) systems. In this paper, we propose a set of formal rules to convert a multidimensional data model into a graph data model (MDM2G). These rules allow conventional star and snowflake schemas to fit into NoSQL graph databases. We apply the proposed rules to implement star-like and snowflake-like graph data warehouses. We compare their performances to similar relational ones focusing on the data model, dimensionality, and size. The experimental results show large differences between relational and graph implementations of a data warehouse. A relational implementation performs better for queries on a couple of tables, but conversely, a graph implementation is better when queries involve many tables. Surprisingly the performances of a star-like and snowflake-like graph data warehouses are very close. Hence a snowflake schema could be used in order to easily consider new sub-dimensions in a graph data warehouse.

30 September 2021 in Informatics
Verified
Journal Article
Open access
PDF file
MDMouhamadou Saliou Diallo
Mouhamadou Saliou Diallo
SMSid Ahmed Mokeddem
Sid Ahmed Mokeddem
ABAgnès Braud
Agnès Braud
GFGabriel Frey
Gabriel Frey
NLNicolas Lachiche
Nicolas Lachiche
Industry 4.0 is characterized by the availability of sensors to operate the so-called intelligent factory. Predictive maintenance, in particular, failure prediction, is an important issue to cut the costs associated with production breaks. We studied more than 40 publications on predictive maintenance. We point out that they focus on various machine learning algorithms rather than on the selection of suitable datasets. In fact, most publications consider a single, usually non-public, benchmark. More benchmarks are needed to design and test the generality of the proposed approaches. This paper is the first to define the requirements on these benchmarks. It highlights that there are only two benchmarks that can be used for supervised learning among the six publicly available ones we found in the literature. We also illustrate how such a benchmark can be used with deep learning to successfully train and evaluate a failure prediction model. We raise several perspectives for research.

22 August 2018 in Machine Learning
Verified
Journal Article
Open access
PDF file
MBMarc Boullé
Marc Boullé
CCClément Charnay
Clément Charnay
NLNicolas Lachiche
Nicolas Lachiche
Companies want to extract value from their relational databases. This is the aim of relational data mining. Propositionalization is one possible approach to relational data mining. Propositionalization adds new attributes, called features, to the main table, leading to an attribute-value representation, a single table, on which a propositional learner can be applied. However, current relational databases are large and composed of mixed, numerical and categorical, data. Moreover, the specificity of relational data is to involve one-to-many relationships. As an example of such data, consider customers purchasing products: each customer can purchase several products. Therefore, there is a need for techniques able to learn complex aggregates. Learning such features means to explore a combinatorial, possibly infinite, space and such an approach is prone to overfitting. We introduce a propositionalization approach dedicated to a robust Bayesian classifier. It efficiently samples a given number of features in the language bias, following a distribution over the complex aggregates. This distribution is also used to penalize complex aggregates in the regularization of the robust Bayesian classifier. Experiments show that it performs better than state-of-the-art methods on most investigated benchmarks and can deal with large datasets more easily. A new real, large, mixed relational dataset is introduced which confirms the ability of our approach to learn complex aggregates.