Monitoring batch processes with dynamic time warping and k-nearest neighbours

被引:13
|
作者
Spooner, Max [1 ]
Kulahci, Murat [1 ,2 ]
机构
[1] Tech Univ Denmark, DTU Compute, Lyngby, Denmark
[2] Lulea Univ Technol, Dept Business Adm Technol & Social Sci, Lulea, Sweden
关键词
Batch process; Dynamic time warping; Nearest neighbours; Pensim; MULTIVARIATE STATISTICAL-ANALYSIS; FAULT-DETECTION; ALIGNMENT; SYNCHRONIZATION;
D O I
10.1016/j.chemolab.2018.10.011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A novel data driven approach to batch process monitoring is presented, which combines the k-Nearest Neighbour rule with the dynamic time warping (DTW) distance. This online method (DTW-NN) calculates the DTW distance between an ongoing batch, and each batch in a reference database of batches produced under normal operating conditions (NOC). The sum of the It smallest DTW distances is monitored. If a fault occurs in the ongoing batch, then this distance increases and an alarm is generated. The monitoring statistic is easy to interpret, being a direct measure of similarity of the ongoing batch to its nearest NOC predecessors and the method makes no distributional assumptions regarding normal operating conditions. DTW-NN is applied to four extensive datasets from simulated batch production of penicillin, and tested on a wide variety of fault types, magnitudes and onset times. Performance of DTW-NN is contrasted with a benchmark multiway PCA approach, and DTW-NN is shown to perform particularly well when there is clustering of batches under NOC.
引用
收藏
页码:102 / 112
页数:11
相关论文
共 50 条
  • [1] Face touch monitoring using an instrumented wristband using dynamic time warping and k-nearest neighbours
    Fathian, Ramin
    Phan, Steven
    Ho, Chester
    Rouhani, Hossein
    [J]. PLOS ONE, 2023, 18 (02):
  • [2] Real-time Monitoring of Batch Processes Using the Fast k-Nearest Neighbor Rule
    Zhou Mei
    Zhou Zhe
    Wen Chenglin
    [J]. PROCEEDINGS OF THE 35TH CHINESE CONTROL CONFERENCE 2016, 2016, : 6843 - 6848
  • [3] An evolutionary voting for k-nearest neighbours
    Mateos-Garcia, Daniel
    Garcia-Gutierrez, Jorge
    Riquelme-Santos, Jose C.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 43 : 9 - 14
  • [4] Forecasting histogram time series with k-nearest neighbours methods
    Arroyo, Javier
    Mate, Carlos
    [J]. INTERNATIONAL JOURNAL OF FORECASTING, 2009, 25 (01) : 192 - 207
  • [5] Wiring networks diagnosis using K-Nearest neighbour classifier and dynamic time warping
    Goudjil, Abdelhak
    Smail, Mostafa Kamel
    Pichon, Lionel
    Bouchekara, Houssem R. E. H.
    Javaid, Muhammad Sharjeel
    [J]. NONDESTRUCTIVE TESTING AND EVALUATION, 2024, 39 (08) : 2888 - 2905
  • [6] Encrypted network behaviors identification based on dynamic time warping and k-nearest neighbor
    Zhu Hejun
    Zhu Liehuang
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (02): : S2571 - S2580
  • [7] Encrypted network behaviors identification based on dynamic time warping and k-nearest neighbor
    Zhu Hejun
    Zhu Liehuang
    [J]. Cluster Computing, 2019, 22 : 2571 - 2580
  • [8] An Improved k-Nearest Neighbours Method for Traffic Time Series Imputation
    Sun, Bin
    Ma, Liyao
    Cheng, Wei
    Wen, Wei
    Goswami, Prashant
    Bai, Guohua
    [J]. 2017 CHINESE AUTOMATION CONGRESS (CAC), 2017, : 7346 - 7351
  • [9] GAIT PHASE SEGMENTATION USING WEIGHTED DYNAMIC TIME WARPING AND K-NEAREST NEIGHBORS GRAPH EMBEDDING
    Chen, Tze-Shen
    Lin, Ting-Ya
    Hong, Y-W Peter
    [J]. 2020 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2020, : 1180 - 1184
  • [10] Dynamic K-Nearest Neighbors For The Monitoring Of Evolving Systems
    Hartert, L.
    Mouchaweh, M. Sayed
    Billaudel, P.
    [J]. 2010 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ-IEEE 2010), 2010,