Monitoring The Mean Vector With Mahalanobis Kernels

Keywords

average run length (ARL); machine learning; Mercer kernel; statistical process control; support vectors

Abstract

Statistical process control (SPC) applies the science of statistics to various process controls in order to provide higher-quality products and better services. Multivariate control charts are essential tools in multivariate SPC. Hotelling’s T2 charts based on rational subgroups of sample sizes larger than one are very sensitive for detecting relatively large shifts in the process mean vectors. However, it makes some very restrictive assumptions (multivariate normal distribution) that are usually difficult to be satisfied in real applications. Modern processes do not satisfy classical methods assumptions, such as normality or linearity. To overcome this issue, introduction of new techniques from statistical machine learning theory has been applied. Control charts based on Support Vector Data Description (SVDD), a popular data classifier method inspired by Support Vector Machines, benefit from a wide variety of choices of kernels, which determine the effectiveness of the whole model. Among the most popular choices of kernels is the Euclidean distance-based Gaussian kernel, which enables SVDD to obtain a flexible data description, thus enhances its overall predictive capability. This paper explores an even more robust approach by incorporating the Mahalanobis distance-based kernel (hereinafter referred to as Mahalanobis kernel) to SVDD and compares it with SVDD using the traditional Gaussian kernel.

Publication Date

7-4-2018

Publication Title

Quality Technology and Quantitative Management

Volume

15

Issue

4

Number of Pages

459-474

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1080/16843703.2016.1226707

Socpus ID

84986193518 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84986193518

This document is currently not available here.

Share

COinS