Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Laplacian spectral method in phase I analysis of profiles

A Laplacian spectral method in phase I analysis of profiles 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Stochastic Models in Business and Industry Wiley

A Laplacian spectral method in phase I analysis of profiles

Loading next page...
 
/lp/wiley/a-laplacian-spectral-method-in-phase-i-analysis-of-profiles-1xfXPWouUD

References (18)

Publisher
Wiley
Copyright
Copyright © 2012 John Wiley & Sons, Ltd.
ISSN
1524-1904
eISSN
1526-4025
DOI
10.1002/asmb.1916
Publisher site
See Article on Publisher Site

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.

Journal

Applied Stochastic Models in Business and IndustryWiley

Published: May 1, 2012

There are no references for this article.