Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/21495
Title: Relaxed Rule-based Learning for Automated Predictive Maintenance: proof of concept
Authors: Razgon, M
Mousavi, A
Keywords: predictive maintenance;failure prediction;rule learning;decision tree;machine learning
Issue Date: 3-Sep-2020
Publisher: MDPI
Citation: Razgon, M. and Mousavi, A. (2020) ‘Relaxed Rule-Based Learning for Automated Predictive Maintenance: Proof of Concept’, Algorithms, 13 (9), 219, pp. 1-22. doi: 10.3390/a13090219.
Abstract: Copyright © 2020 by the authors. In this paper we propose a novel approach of rule learning called Relaxed Separate-and- Conquer (RSC): a modification of the standard Separate-and-Conquer (SeCo) methodology that does not require elimination of covered rows. This method can be seen as a generalization of the methods of SeCo and weighted covering that does not suffer from fragmentation. We present an empirical investigation of the proposed RSC approach in the area of Predictive Maintenance (PdM) of complex manufacturing machines, to predict forthcoming failures of these machines. In particular, we use for experiments a real industrial case study of a machine which manufactures the plastic bottle. We compare the RSC approach with a Decision Tree (DT) based and SeCo algorithms and demonstrate that RSC significantly outperforms both DT based and SeCo rule learners. We conclude that the proposed RSC approach is promising for PdM guided by rule learning.
Description: Correction published on 12 March 2021, see Algorithms 2021, 14(3), 86. doi: 10.3390/a14030086.
URI: https://bura.brunel.ac.uk/handle/2438/21495
DOI: https://doi.org/10.3390/a13090219
Other Identifiers: 219
ORCID iD: Alireza Mousavi https://orcid.org/0000-0003-0360-2712
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf331.94 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons