Stéphane Lecoeuche
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Stéphane Lecoeuche has a total of 104 co-authors. Here are the top co-authors by number of shared publications:
- Eric Duviella
IMT Nord Europe, Institute Mines-Télécom, University of Lille, Centre for Education, Research and Innovation in Digital Systems (CERI Digital Systems), F-59500 Douai, France
14 shared publications Laurent Bako
11 shared publications- Guillaume Mercère
Université de Poitiers ISAE-ENSMA LIAS Poitiers France
10 shared publications Khaled Boukharouba
7 shared publications- Arnaud Doniec
Research Center IMT Lille Douai University of Lille 59500 Douai France
6 shared publications Jacques Boonaert
IMT Lille Douai, Univ. Lille, Unité de Recherche Informatique Automatique, F-59000 Lille, France
6 shared publications
Latest Publications
- 1 July 2021
- Published by Elsevier in ISA Transactions
- Vol. 113, 185-195
Data-driven fault detection of open circuits in multi-phase inverters based on current polarity using Auto-adaptive and Dynamical Clustering
- 1 July 2021
- Published by Elsevier in ISA Transactions
- Vol. 113, 185-195
Data-driven fault detection of open circuits in multi-phase inverters based on current polarity using Auto-adaptive and Dynamical Clustering
- 1 June 2020
- Published by Elsevier in Information Sciences
- Vol. 521, 380-397
Purchase intention-based agent for customer behaviours
- 1 June 2020
- Published by Elsevier in Information Sciences
- Vol. 521, 380-397
Purchase intention-based agent for customer behaviours
- Open Access
- 16 February 2020
- Published by HAL
Mining Frequent Seasonal Gradual Patterns
Mining frequent episodes aims at recovering sequential patterns from temporal data sequences, which can then be used to predict the occurrence of related events in advance. On the other hand, gradual patterns that capture co-variation of complex attributes in the form "When X increases/decreases, Y increases/decreases" play an important role in many real world applications where huge volumes of complex numerical data must be handled. More recently, they have received attention from the data mining community for exploring temporal data and methods have been defined to automatically extract gradual patterns from temporal data. However, to the best of our knowledge, no method has been proposed to extract gradual patterns that always appear at the identical time intervals in the sequences of temporal data, despite the knowledge that such patterns may bring in certain applications. In this paper, we propose to extract co-variations of periodically repeating attributes from the sequences of temporal data that we call seasonal gradual patterns. We discuss the specific features of these patterns and propose an approach for their extraction by exploiting motif mining algorithms in a sequence, and justify its applicability to the gradual case. Illustrative results obtained from a real world data set are described and show the interest for such patterns.
- 16 February 2020
- Published by HAL
Open AccessMining Frequent Seasonal Gradual Patterns
Mining frequent episodes aims at recovering sequential patterns from temporal data sequences, which can then be used to predict the occurrence of related events in advance. On the other hand, gradual patterns that capture co-variation of complex attributes in the form "When X increases/decreases, Y increases/decreases" play an important role in many real world applications where huge volumes of complex numerical data must be handled. More recently, they have received attention from the data mining community for exploring temporal data and methods have been defined to automatically extract gradual patterns from temporal data. However, to the best of our knowledge, no method has been proposed to extract gradual patterns that always appear at the identical time intervals in the sequences of temporal data, despite the knowledge that such patterns may bring in certain applications. In this paper, we propose to extract co-variations of periodically repeating attributes from the sequences of temporal data that we call seasonal gradual patterns. We discuss the specific features of these patterns and propose an approach for their extraction by exploiting motif mining algorithms in a sequence, and justify its applicability to the gradual case. Illustrative results obtained from a real world data set are described and show the interest for such patterns.
- Open Access
Mining Frequent Seasonal Gradual Patterns
Mining frequent episodes aims at recovering sequential patterns from temporal data sequences, which can then be used to predict the occurrence of related events in advance. On the other hand, gradual patterns that capture co-variation of complex attributes in the form "When X increases/decreases, Y increases/decreases" play an important role in many real world applications where huge volumes of complex numerical data must be handled. More recently, they have received attention from the data mining community for exploring temporal data and methods have been defined to automatically extract gradual patterns from temporal data. However, to the best of our knowledge, no method has been proposed to extract gradual patterns that always appear at the identical time intervals in the sequences of temporal data, despite the knowledge that such patterns may bring in certain applications. In this paper, we propose to extract co-variations of periodically repeating attributes from the sequences of temporal data that we call seasonal gradual patterns. We discuss the specific features of these patterns and propose an approach for their extraction by exploiting motif mining algorithms in a sequence, and justify its applicability to the gradual case. Illustrative results obtained from a real world data set are described and show the interest for such patterns.
Open AccessMining Frequent Seasonal Gradual Patterns
Mining frequent episodes aims at recovering sequential patterns from temporal data sequences, which can then be used to predict the occurrence of related events in advance. On the other hand, gradual patterns that capture co-variation of complex attributes in the form "When X increases/decreases, Y increases/decreases" play an important role in many real world applications where huge volumes of complex numerical data must be handled. More recently, they have received attention from the data mining community for exploring temporal data and methods have been defined to automatically extract gradual patterns from temporal data. However, to the best of our knowledge, no method has been proposed to extract gradual patterns that always appear at the identical time intervals in the sequences of temporal data, despite the knowledge that such patterns may bring in certain applications. In this paper, we propose to extract co-variations of periodically repeating attributes from the sequences of temporal data that we call seasonal gradual patterns. We discuss the specific features of these patterns and propose an approach for their extraction by exploiting motif mining algorithms in a sequence, and justify its applicability to the gradual case. Illustrative results obtained from a real world data set are described and show the interest for such patterns.
- 1 February 2020
- Published by Elsevier in Journal of Process Control
- Vol. 86, 44-56
Data-driven modeling for river flood forecasting based on a piecewise linear ARX system identification
- 1 February 2020
- Published by Elsevier in Journal of Process Control
- Vol. 86, 44-56
Data-driven modeling for river flood forecasting based on a piecewise linear ARX system identification
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 1912-1917
An Algebraic Approach for Discrete Dynamic Reconstruction for Switched Bilinear Systems
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 1912-1917
An Algebraic Approach for Discrete Dynamic Reconstruction for Switched Bilinear Systems
- 18 October 2019
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 30 (1) , 182-197
Input‐to‐state stability of switched nonlinear systems with delay in the active mode detection
Summary: A switched nonlinear system subject to disturbances is considered in this paper. The switching signal admits an average dwell time and a state feedback control depending on the system operating modes, detected with a maximum time delay, is applied to the system. In this framework, the input‐to‐state stability problem of the closed‐loop system is addressed. Based on some established existence conditions of mode‐dependent Lyapunov‐like functions, the values of the maximum time delay and the average dwell time that allow to achieve the input‐to‐state stability of the closed‐loop system are determined. In order to obtain more tractable results, the existence conditions of the mode‐dependent Lyapunov‐like functions are given in terms of sum‐of‐squares programming in the case of polynomial nonlinearities. In the linear case, they are expressed in terms of linear matrix inequalities and a procedure for the synthesis of the mode‐dependent controller is provided in this situation. The established theoretical results are illustrated through a control problem of a building ventilation system and a switched control problem of a vehicle suspension system.
- 18 October 2019
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 30 (1) , 182-197
Input‐to‐state stability of switched nonlinear systems with delay in the active mode detection
Summary: A switched nonlinear system subject to disturbances is considered in this paper. The switching signal admits an average dwell time and a state feedback control depending on the system operating modes, detected with a maximum time delay, is applied to the system. In this framework, the input‐to‐state stability problem of the closed‐loop system is addressed. Based on some established existence conditions of mode‐dependent Lyapunov‐like functions, the values of the maximum time delay and the average dwell time that allow to achieve the input‐to‐state stability of the closed‐loop system are determined. In order to obtain more tractable results, the existence conditions of the mode‐dependent Lyapunov‐like functions are given in terms of sum‐of‐squares programming in the case of polynomial nonlinearities. In the linear case, they are expressed in terms of linear matrix inequalities and a procedure for the synthesis of the mode‐dependent controller is provided in this situation. The established theoretical results are illustrated through a control problem of a building ventilation system and a switched control problem of a vehicle suspension system.
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 306-311
Auto-adaptive and Dynamical Clustering for Double Open-Circuit Fault Diagnosis of Power Inverters
This paper extends the authors' previous work on a diagnosis algorithm for single open-circuit faults in inverters to the double fault case. The proposed approach is entirely data-driven, using measurements of the stator currents. The first contribution of the present work resides in new choices for the feature variables which allow us to detect double open-circuit faults. These feature data are clustered to different classes corresponding to faulty modes using Auto-adaptive and Dynamical Clustering (AUDyC). These classes are then labelled appropriately which allows us to determine conditions for the fault detection and isolation. Moreover, the values of the algorithm parameters and their influence on the detection time are presented. The proposed improvements are validated on simulation data.
- 1 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 306-311
Auto-adaptive and Dynamical Clustering for Double Open-Circuit Fault Diagnosis of Power Inverters
This paper extends the authors' previous work on a diagnosis algorithm for single open-circuit faults in inverters to the double fault case. The proposed approach is entirely data-driven, using measurements of the stator currents. The first contribution of the present work resides in new choices for the feature variables which allow us to detect double open-circuit faults. These feature data are clustered to different classes corresponding to faulty modes using Auto-adaptive and Dynamical Clustering (AUDyC). These classes are then labelled appropriately which allows us to determine conditions for the fault detection and isolation. Moreover, the values of the algorithm parameters and their influence on the detection time are presented. The proposed improvements are validated on simulation data.