Training data reduction for nonlinear state estimator

Author(s):  
Hiroaki Ishiyama ◽  
Masaki Yamakita
2019 ◽  
Vol 8 (3) ◽  
pp. 4373-4378

The amount of data belonging to different domains are being stored rapidly in various repositories across the globe. Extracting useful information from the huge volumes of data is always difficult due to the dynamic nature of data being stored. Data Mining is a knowledge discovery process used to extract the hidden information from the data stored in various repositories, termed as warehouses in the form of patterns. One of the popular tasks of data mining is Classification, which deals with the process of distinguishing every instance of a data set into one of the predefined class labels. Banking system is one of the realworld domains, which collects huge number of client data on a daily basis. In this work, we have collected two variants of the bank marketing data set pertaining to a Portuguese financial institution consisting of 41188 and 45211 instances and performed classification on them using two data reduction techniques. Attribute subset selection has been performed on the first data set and the training data with the selected features are used in classification. Principal Component Analysis has been performed on the second data set and the training data with the extracted features are used in classification. A deep neural network classification algorithm based on Backpropagation has been developed to perform classification on both the data sets. Finally, comparisons are made on the performance of each deep neural network classifier with the four standard classifiers, namely Decision trees, Naïve Bayes, Support vector machines, and k-nearest neighbors. It has been found that the deep neural network classifier outperforms the existing classifiers in terms of accuracy


2014 ◽  
Vol 41 (2) ◽  
pp. 405-420 ◽  
Author(s):  
Senzhang Wang ◽  
Zhoujun Li ◽  
Chunyang Liu ◽  
Xiaoming Zhang ◽  
Haijun Zhang

2014 ◽  
Vol 11 (2) ◽  
pp. 665-678 ◽  
Author(s):  
Stefanos Ougiaroglou ◽  
Georgios Evangelidis

Data reduction techniques improve the efficiency of k-Nearest Neighbour classification on large datasets since they accelerate the classification process and reduce storage requirements for the training data. IB2 is an effective prototype selection data reduction technique. It selects some items from the initial training dataset and uses them as representatives (prototypes). Contrary to many other techniques, IB2 is a very fast, one-pass method that builds its reduced (condensing) set in an incremental manner. New training data can update the condensing set without the need of the ?old? removed items. This paper proposes a variation of IB2, that generates new prototypes instead of selecting them. The variation is called AIB2 and attempts to improve the efficiency of IB2 by positioning the prototypes in the center of the data areas they represent. The empirical experimental study conducted in the present work as well as the Wilcoxon signed ranks test show that AIB2 performs better than IB2.


Author(s):  
Ricardo Aguilar-López ◽  
Ricardo Acevedo-Gómez ◽  
Marí­a Isabel Neria González ◽  
Alma Rosa Domí­nguez-Bocanegra

In this work, the state estimation of key variables such as biomass and products of a sulfate reducing bacterium is predicted by using only sulfate (substrate) concentration measurements under the assumption of an unknown kinetic term. The process was developed by  ontinuous culture, where the mathematical kinetic model for the biomass, sulfate and sulfide concentrations is presented and tuned using experimental data. The design of the nonlinear state estimator takes into account an adaptive gain. The results of the proposed estimation methodology were generated via numerical simulation; they showed a satisfactory performance.


Sign in / Sign up

Export Citation Format

Share Document