Machine-tool condition monitoring with Gaussian mixture models-based dynamic probabilistic clustering

被引:22
作者
Diaz-Rozo, Javier [1 ,2 ]
Bielza, Concha [2 ]
Larranaga, Pedro [2 ]
机构
[1] Aingura HoT, San Antolin 3, Elgoibar 20870, Spain
[2] Univ Politecn Madrid, Dept Inteligencia Artificial, Madrid, Spain
关键词
Concept drift; Condition monitoring; Data stream; Dynamic clustering; Gaussian mixture model; Machining operation; DATA STREAMS; TIME-SERIES;
D O I
10.1016/j.engappai.2019.103434
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The combination of artificial intelligence with data, computing power, and new algorithms can provide important tools for solving engineering problems, such as machine-tool condition monitoring. However, many of these problems require algorithms that can perform in highly dynamic scenarios where the data streams have extremely high sampling rates from different types of variables. The unsupervised learning algorithm based on Gaussian mixture models called Gaussian-based dynamic probabilistic clustering (GDPC) is one of these tools. However, this algorithm may have major limitations if a large amount of concept drifts associated with transients occurs within the data stream. GDPC becomes unstable under these conditions, so we propose a new algorithm called GDPC+ to increase its robustness. GDPC+ represents an important improvement because we introduce: (a) automatic selection of the number of mixture components based on the Bayesian information criterion (BIC), and (b) concept drift transition stabilization based on Cauchy-Schwarz divergence integrated with the Dickey Fuller test. Thus, GDPC+ can perform better in highly dynamic scenarios than GDPC in terms of the number of false positives. The behavior of GDPC+ was investigated using random synthetic data streams and in a real data stream-based condition monitoring obtained from a machine-tool that produces engine crankshafts at high speed. We found that the initial temporal window size can be used to adapt the algorithm to different analytical requirements. The clustering results were also investigated by induction of the rules generated by the repeated incremental pruning to produce error reduction (RIPPER) algorithm in order to provide insights from the underlying monitored process and its associated concept drifts.
引用
收藏
页数:13
相关论文
共 34 条
[1]  
Ackermann M.R., 2012, ACM J Exp Algorithmics, V17, p2.1, DOI DOI 10.1145/2133803.2184450
[2]  
Aggarwal Charu C., 2003, P 2003 VLDB C, P81, DOI DOI 10.1016/B978-012722442-8/50016-1
[3]  
[Anonymous], INT J INF COMMUN TEC
[4]   Density-Based Clustering over an Evolving Data Stream with Noise [J].
Cao, Feng ;
Ester, Martin ;
Qian, Weining ;
Zhou, Aoying .
PROCEEDINGS OF THE SIXTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2006, :328-+
[5]  
Chen YX, 2007, KDD-2007 PROCEEDINGS OF THE THIRTEENTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P133
[6]   LAG ORDER AND CRITICAL-VALUES OF THE AUGMENTED DICKEY-FULLER TEST [J].
CHEUNG, YW ;
LAI, KS .
JOURNAL OF BUSINESS & ECONOMIC STATISTICS, 1995, 13 (03) :277-280
[7]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[8]   Clustering of Data Streams With Dynamic Gaussian Mixture Models: An IoT Application in Industrial Processes [J].
Diaz-Rozo, Javier ;
Bielza, Concha ;
Larranaga, Pedro .
IEEE INTERNET OF THINGS JOURNAL, 2018, 5 (05) :3533-3547
[9]   Machine learning-based CPS for clustering high throughput machining cycle conditions [J].
Diaz-Rozo, Javier ;
Bielza, Concha ;
Larranaga, Pedro .
45TH SME NORTH AMERICAN MANUFACTURING RESEARCH CONFERENCE (NAMRC 45), 2017, 10 :997-1008
[10]   DISTRIBUTION OF THE ESTIMATORS FOR AUTOREGRESSIVE TIME-SERIES WITH A UNIT ROOT [J].
DICKEY, DA ;
FULLER, WA .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1979, 74 (366) :427-431