Machine Learning for Diagnosis of Event Synchronization Faults in Discrete Manufacturing Systems

2021 ◽  
pp. 1-31
Author(s):  
Joseph Cohen ◽  
Baoyang Jiang ◽  
Jun Ni
Keyword(s):  
Machine Learning ◽  
Fault Diagnosis ◽  
Random Forest ◽  
Anomaly Detection ◽  
Unsupervised Learning ◽  
Learning Algorithms ◽  
Discrete Event ◽  
Machine Learning Algorithms ◽  
Programmable Logic ◽  
Discrete Manufacturing

Abstract Common in discrete manufacturing, timed event systems often have strict synchronization requirements for healthy operation. Discrete event system methods have been used as mathematical tools to detect known faults, but do not scale well for problems with extensive variability in the normal class. A hybridized discrete event and data-driven method is suggested to supplement fault diagnosis in the case where failure patterns are not known in advance. A unique fault diagnosis framework consisting of signal data from programmable logic controllers, a Timed Petri Net of the normal process behavior, and machine learning algorithms is presented to improve fault diagnosis of timed event systems. Various supervised and unsupervised machine learning algorithms are explored as the methodology is implemented to a case study in semiconductor manufacturing. State-of-the-art classifiers such as artificial neural networks, support vector machines, and random forests are implemented and compared for handling multi-fault diagnosis using programmable logic controller signal data. For unsupervised learning, classifiers based on principal component analysis utilizing major and minor principal components are compared for anomaly detection. The rule-based random forest and extreme random forest classifiers achieve excellent performance with a precision and recall score of 0.96 for multi-fault classification. Additionally, the unsupervised learning approach yields anomaly detection rates of 98% with false alarms under 3% with a training set 99% smaller than the supervised learning classifiers. These results obtained on a real use case are promising to enable prognostic tools in industrial automation systems in the future

Fault Diagnosis of Timed Event Systems: An Exploration of Machine Learning Methods

2020 ◽  
Author(s):  
Joseph Cohen ◽  
Baoyang Jiang ◽  
Jun Ni
Keyword(s):  
Machine Learning ◽  
Fault Diagnosis ◽  
Anomaly Detection ◽  
Unsupervised Learning ◽  
Learning Algorithms ◽  
Discrete Event ◽  
Machine Learning Algorithms ◽  
Programmable Logic ◽  
Event Systems ◽  
Learning Classifiers

Abstract Especially common in discrete manufacturing, timed event systems often require a high degree of synchronization for healthy operation. Discrete event system methods have been used as mathematical tools to detect known faults, but do not scale well for problems with extensive variability in the normal class. A hybridized discrete event and data-driven method is suggested to supplement fault diagnosis in the case where failure patterns are not known in advance. A unique fault diagnosis framework consisting of signal data from programmable logic controllers, a Timed Petri Net of the normal process behavior, and machine learning algorithms is presented to improve fault diagnosis of timed event systems. Various supervised and unsupervised machine learning algorithms are explored as the methodology is implemented to a case study in semiconductor manufacturing. State-of-the-art classifiers such as artificial neural networks, support vector machines, and random forests are implemented and compared for handling multi-fault diagnosis using programmable logic controller signal data. For unsupervised learning, classifiers based on principal component analysis utilizing major and minor principal components are compared for anomaly detection. The rule-based extreme random forest classifier achieves the highest validation accuracy of 98% for multi-fault classification. Likewise, the unsupervised learning approach shows similar success, yielding anomaly detection rates of 98% with false alarms under 3%. The industrial feasibility of this method is notable, with the results achieved with a training set 99% smaller than the supervised learning classifiers.

Detecting Interesting and Anomalous Patterns In Multivariate Time-Series Data in an Offshore Platform Using Unsupervised Learning

2021 ◽  
Author(s):  
Ilan Sousa Figueirêdo ◽  
Tássio Farias Carvalho ◽  
Wenisten José Dantas Silva ◽  
Lílian Lefol Nani Guarieiro ◽  
Erick Giovani Sperandio Nascimento
Keyword(s):  
Machine Learning ◽  
Time Series ◽  
Anomaly Detection ◽  
Unsupervised Learning ◽  
Time Series Data ◽  
Multivariate Time Series ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Series Data ◽  
Unsupervised Machine Learning

Abstract Detection of anomalous events in practical operation of oil and gas (O&G) wells and lines can help to avoid production losses, environmental disasters, and human fatalities, besides decreasing maintenance costs. Supervised machine learning algorithms have been successful to detect, diagnose, and forecast anomalous events in O&G industry. Nevertheless, these algorithms need a large quantity of annotated dataset and labelling data in real world scenarios is typically unfeasible because of exhaustive work of experts. Therefore, as unsupervised machine learning does not require an annotated dataset, this paper intends to perform a comparative evaluation performance of unsupervised learning algorithms to support experts for anomaly detection and pattern recognition in multivariate time-series data. So, the goal is to allow experts to analyze a small set of patterns and label them, instead of analyzing large datasets. This paper used the public 3W database of three offshore naturally flowing wells. The experiment used real data of production of O&G from underground reservoirs with the following anomalous events: (i) spurious closure of Downhole Safety Valve (DHSV) and (ii) quick restriction in Production Choke (PCK). Six unsupervised machine learning algorithms were assessed: Cluster-based Algorithm for Anomaly Detection in Time Series Using Mahalanobis Distance (C-AMDATS), Luminol Bitmap, SAX-REPEAT, k-NN, Bootstrap, and Robust Random Cut Forest (RRCF). The comparison evaluation of unsupervised learning algorithms was performed using a set of metrics: accuracy (ACC), precision (PR), recall (REC), specificity (SP), F1-Score (F1), Area Under the Receiver Operating Characteristic Curve (AUC-ROC), and Area Under the Precision-Recall Curve (AUC-PRC). The experiments only used the data labels for assessment purposes. The results revealed that unsupervised learning successfully detected the patterns of interest in multivariate data without prior annotation, with emphasis on the C-AMDATS algorithm. Thus, unsupervised learning can leverage supervised models through the support given to data annotation.

scholarly journals Feature Selection and Comparison of Machine Learning Algorithms in Classification of Grazing and Rumination Behaviour in Sheep

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3532 ◽  
Author(s):  
Nicola Mansbridge ◽  
Jurgen Mitsch ◽  
Nicola Bollard ◽  
Keith Ellis ◽  
Giuliana Miguel-Pacheco ◽  
...  
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Time Budget ◽  
Learning Algorithms ◽  
Eating Behaviour ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Optimum Number ◽  
Eating Behaviours ◽  
Adaptive Boosting

Grazing and ruminating are the most important behaviours for ruminants, as they spend most of their daily time budget performing these. Continuous surveillance of eating behaviour is an important means for monitoring ruminant health, productivity and welfare. However, surveillance performed by human operators is prone to human variance, time-consuming and costly, especially on animals kept at pasture or free-ranging. The use of sensors to automatically acquire data, and software to classify and identify behaviours, offers significant potential in addressing such issues. In this work, data collected from sheep by means of an accelerometer/gyroscope sensor attached to the ear and collar, sampled at 16 Hz, were used to develop classifiers for grazing and ruminating behaviour using various machine learning algorithms: random forest (RF), support vector machine (SVM), k nearest neighbour (kNN) and adaptive boosting (Adaboost). Multiple features extracted from the signals were ranked on their importance for classification. Several performance indicators were considered when comparing classifiers as a function of algorithm used, sensor localisation and number of used features. Random forest yielded the highest overall accuracies: 92% for collar and 91% for ear. Gyroscope-based features were shown to have the greatest relative importance for eating behaviours. The optimum number of feature characteristics to be incorporated into the model was 39, from both ear and collar data. The findings suggest that one can successfully classify eating behaviours in sheep with very high accuracy; this could be used to develop a device for automatic monitoring of feed intake in the sheep sector to monitor health and welfare.

scholarly journals Techniques for Detecting Malware Traffic: A Comprehensive Approach to Feature Selection and Classification

2021 ◽  
Vol 9 (12) ◽  
pp. 1-10
Author(s):  
Harsha A K
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Random Forest ◽  
Learning Algorithms ◽  
Malware Detection ◽  
Machine Learning Algorithms ◽  
Gradient Boosting ◽  
Support Vector ◽  
Steady Increase ◽  
Extreme Gradient Boosting

Abstract: Since the advent of encryption, there has been a steady increase in malware being transmitted over encrypted networks. Traditional approaches to detect malware like packet content analysis are inefficient in dealing with encrypted data. In the absence of actual packet contents, we can make use of other features like packet size, arrival time, source and destination addresses and other such metadata to detect malware. Such information can be used to train machine learning classifiers in order to classify malicious and benign packets. In this paper, we offer an efficient malware detection approach using classification algorithms in machine learning such as support vector machine, random forest and extreme gradient boosting. We employ an extensive feature selection process to reduce the dimensionality of the chosen dataset. The dataset is then split into training and testing sets. Machine learning algorithms are trained using the training set. These models are then evaluated against the testing set in order to assess their respective performances. We further attempt to tune the hyper parameters of the algorithms, in order to achieve better results. Random forest and extreme gradient boosting algorithms performed exceptionally well in our experiments, resulting in area under the curve values of 0.9928 and 0.9998 respectively. Our work demonstrates that malware traffic can be effectively classified using conventional machine learning algorithms and also shows the importance of dimensionality reduction in such classification problems. Keywords: Malware Detection, Extreme Gradient Boosting, Random Forest, Feature Selection.

PSIX-15 Assessment of machine learning algorithms for prediction of Aleutian disease in American mink

2021 ◽  
Vol 99 (Supplement_3) ◽  
pp. 264-265
Author(s):  
Duy Ngoc Do ◽  
Guoyu Hu ◽  
Younes Miar
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Linear Models ◽  
American Mink ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Enzyme Linked Immunosorbent Assay ◽  
Linear Discriminant ◽  
Machine Learning Classification

Abstract American mink (Neovison vison) is the major source of fur for the fur industries worldwide and Aleutian disease (AD) is causing severe financial losses to the mink industry. Different methods have been used to diagnose the AD in mink, but the combination of several methods can be the most appropriate approach for the selection of AD resilient mink. Iodine agglutination test (IAT) and counterimmunoelectrophoresis (CIEP) methods are commonly employed in test-and-remove strategy; meanwhile, enzyme-linked immunosorbent assay (ELISA) and packed-cell volume (PCV) methods are complementary. However, using multiple methods are expensive; and therefore, hindering the corrected use of AD tests in selection. This research presented the assessments of the AD classification based on machine learning algorithms. The Aleutian disease was tested on 1,830 individuals using these tests in an AD positive mink farm (Canadian Centre for Fur Animal Research, NS, Canada). The accuracy of classification for CIEP was evaluated based on the sex information, and IAT, ELISA and PCV test results implemented in seven machine learning classification algorithms (Random Forest, Artificial Neural Networks, C50Tree, Naive Bayes, Generalized Linear Models, Boost, and Linear Discriminant Analysis) using the Caret package in R. The accuracy of prediction varied among the methods. Overall, the Random Forest was the best-performing algorithm for the current dataset with an accuracy of 0.89 in the training data and 0.94 in the testing data. Our work demonstrated the utility and relative ease of using machine learning algorithms to assess the CIEP information, and consequently reducing the cost of AD tests. However, further works require the inclusion of production and reproduction information in the models and extension of phenotypic collection to increase the accuracy of current methods.

Abstract 15895: Machine Learning Algorithms to Predict Major Adverse Cardiovascular Events in Patients Undergoing Orthotopic Liver Transplantation: A Retrospective Cohort Study

Circulation ◽  
2020 ◽  
Vol 142 (Suppl_3) ◽  
Author(s):  
vardhmaan jain ◽  
Vikram Sharma ◽  
Agam Bansal ◽  
Cerise Kleb ◽  
Chirag Sheth ◽  
...  
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Cardiovascular Events ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Major Adverse Cardiovascular Events ◽  
Support Vector ◽  
Post Transplant ◽  
Extreme Gradient Boosting ◽  
All Cause Mortality

Background: Post-transplant major adverse cardiovascular events (MACE) are amongst the leading cause of death amongst orthotopic liver transplant(OLT) recipients. Despite years of guideline directed therapy, there are limited data on predictors of post-OLT MACE. We assessed if machine learning algorithms (MLA) can predict MACE and all-cause mortality in patients undergoing OLT. Methods: We tested three MLA: support vector machine, extreme gradient boosting(XG-Boost) and random forest with traditional logistic regression for prediction of MACE and all-cause mortality on a cohort of consecutive patients undergoing OLT at our center between 2008-2019. The cohort was randomly split into a training (80%) and testing (20%) cohort. Model performance was assessed using c-statistic or AUC. Results: We included 1,459 consecutive patients with mean ± SD age 54.2 ± 13.8 years, 32% female who underwent OLT. There were 199 (13.6%) MACE and 289 (20%) deaths at a mean follow up of 4.56 ± 3.3 years. The random forest MLA was the best performing model for predicting MACE [AUC:0.78, 95% CI: 0.70-0.85] as well as mortality [AUC:0.69, 95% CI: 0.61-0.76], with all models performing better when predicting MACE vs mortality. See Table and Figure. Conclusion: Random forest machine learning algorithms were more predictive and discriminative than traditional regression models for predicting major adverse cardiovascular events and all-cause mortality in patients undergoing OLT. Validation and subsequent incorporation of MLA in clinical decision making for OLT candidacy could help risk stratify patients for post-transplant adverse cardiovascular events.

Sign in / Sign up

Export Citation Format

Share Document