Nearest Neighbour Based Algorithm for Data Reduction and Fault Diagnosis

Detroja, Ketan P (2013) Nearest Neighbour Based Algorithm for Data Reduction and Fault Diagnosis. In: IEEE International Conference on Control Applications, CCA 2013, 28-30 August 2013, Hyderabad; India.

Full text not available from this repository. (Request a copy)

Abstract

Dimensionality reduction is one of the prime concerns when analyzing process historical data for plant-wide monitoring, because this can significantly reduce computational load during statistical model building. Most research has been concerned with reducing the dimension along the variable space, i.e. reducing the number of columns. However, no efforts are made to reduce dimensions along the sample (row) space. In this paper, an algorithm based on nearest neighbor is presented here that exploits the principle of distributional equivalence (PDE) property of the correspondence analysis (CA) algorithm to achieve data reduction along the sample space without significantly affecting the diagnostic performance. The data reduction algorithm presented here is unsupervised and can achieve significant data reduction when used in conjunction with CA. The data reduction ability of the proposed methodology is demonstrated using the benchmark Tennessee Eastman process simulation case study

[error in script]
IITH Creators:
IITH CreatorsORCiD
Detroja, Ketan PUNSPECIFIED
Item Type: Conference or Workshop Item (Paper)
Subjects: Others > Electricity
Divisions: Department of Electrical Engineering
Depositing User: Team Library
Date Deposited: 27 Nov 2014 11:45
Last Modified: 05 Sep 2017 07:14
URI: http://raiith.iith.ac.in/id/eprint/1031
Publisher URL: https://doi.org/10.1109/CCA.2013.6662910
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 1031 Statistics for this ePrint Item