A Laplacian spectral method in phase I analysis of profiles

  • Authors:
  • Francisco Moura Neto;Maysa S. De Magalhães

  • Affiliations:
  • Instituto Politécnico, Universidade do Estado do Rio de Janeiro, Rua Alberto Rangel s/n, 28630-050, Nova Friburgo, RJBrazil;Escola Nacional de Ciências Estatísticas, Instituto Brasileiro de Geografia e Estatística, Rua André Cavalcanti 106, 20231-050 – Rio de Janeiro, RJBrazil

  • Venue:
  • Applied Stochastic Models in Business and Industry
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The statistical process control of certain complex production processes or products rely on the monitoring of profiles. In this work, we consider a spectral-based method to distinguish between outlier and nonoutlier observations to establish profile parameters. The proposed method is based on the spectral theory of the Laplacian of a graph, more specifically, a Laplacian eigenmap. The graph is constructed by considering each profile as a node, and by adjusting edge weights on the graph to reflect the resemblance between profiles. Laplacian eigenmaps have been used to represent data, to reduce data dimension, and for clustering. The proposed method can be used for complex profiles because it does not require the function between the dependent and independent variables. We apply the proposed method to an artificially generated data set from a nonlinear profile and to a wood board production problem. The results are compared with existing methods in the literature and show that the proposed method performs satisfactorily. Copyright © 2012 John Wiley & Sons, Ltd.