Adaptive Mahalanobis Distance and $k$-Nearest Neighbor Rule for Fault Detection in Semiconductor Manufacturing

Abstract

In recent years, fault detection has become a crucial issue in semiconductor manufacturing. Indeed, it is necessary to constantly improve equipment productivity. Rapid detection of abnormal behavior is one of the primary objectives. Statistical methods such as control charts are the most widely used approaches for fault detection. Due to the number of variables and the possible correlations between them, these control charts need to be multivariate. Among them, the most popular is probably the Hotelling T2 rule. However, this rule only makes sense when the variables are Gaussian, which is rarely true in practice. A possible alternative is to use nonparametric control charts, such as the k-nearest neighbor detection rule by He and Wang, in 2007, only constructed from the learning sample and without assumption on the variables distribution. This approach consists in evaluating the distance of an observation to its nearest neighbors in the learning sample constituted of observations under control. A fault is declared if this distance is too large. In this paper, a new adaptive Mahalanobis distance, which takes into account the local structure of dependence of the variables, is proposed. Simulation trials are performed to study the benefit of the new distance against the Euclidean distance. The method is applied on the photolithography step of the manufacture of an integrated circuit.