Welcome To UTPedia

We would like to introduce you, the new knowledge repository product called UTPedia. The UTP Electronic and Digital Intellectual Asset. It stores digitized version of thesis, dissertation, final year project reports and past year examination questions.

Browse content of UTPedia using Year, Subject, Department and Author and Search for required document using Searching facilities included in UTPedia. UTPedia with full text are accessible for all registered users, whereas only the physical information and metadata can be retrieved by public users. UTPedia collaborating and connecting peoples with university’s intellectual works from anywhere.

Disclaimer - Universiti Teknologi PETRONAS shall not be liable for any loss or damage caused by the usage of any information obtained from this web site.Best viewed using Mozilla Firefox 3 or IE 7 with resolution 1024 x 768.

SLIDING WINDOW TRAINING ALGORITHMS USING MLP-NETWORK FOR CORRELATED AND LOST PACKET DATA

AHMED IZZELDIN, HUZAIFA TAWFEIG (2012) SLIDING WINDOW TRAINING ALGORITHMS USING MLP-NETWORK FOR CORRELATED AND LOST PACKET DATA. Masters thesis, UNIVERSITI TEKNOLOGI PETRONAS.

[img]
Preview
PDF
Download (439Kb) | Preview

Abstract

Multilayer Perceptron neural networks (MLP) are mathematicaVcomputational models inspired by imitating the biological central nervous system and its neurons. MLPs gained an immense attention due to its simplicity, good generalization and its ability to capture complex relationships between variables via a series of input-output measurements. MLPs are well-known tools used in nonlinear system identification, statistical modelling, adaptive control signal, image processing and for many applications. The crucial part about MLP is the learning or training process in which the weights are tuned on the presence of input data to produce a reliable and accurate estimation. This thesis gives a systematic investigation of various MLP learning mainly Sliding Window (SW) learning mode which is treated as the adaptation of offline algorithms into online application Consequently this thesis reviews various offline algorithms including: batch backpropagation, nonlinear conjugate gradient, limited memory and full-memory Broyden, Fletcher, Goldfarb and Shanno algorithms and different forms of the latest proposed bimary ensemble learning. The research work also investigates several recursive algorithms including recursive Kalman filter (RKF) and extended Kalman filter (EKF) using extreme learning machine (ELM) and hybrid linear/nonlinear training technique by incorporating the fiee derivative concept. The SW learning is investigated with different resetting criterion, diierent step size choices and different window sizes in addition to improving the existing SW module by proposing different data store management @SM) techniques that is used to reduce correlation inside the window store. The proposed data store management technique is combined with the central finite difference based gradient estimate to generate a model robust against both correlated data and irregular sampled data. Three nonlinear dynarnical test cases are used as a benchmark in this thesis which is single, split level and V-shape tanks system with varying complexity and correlation level to provide suitable testing conditions.

Item Type: Thesis (Masters)
Subject: UNSPECIFIED
Divisions: UNSPECIFIED
Depositing User: Users 6 not found.
Date Deposited: 25 Jul 2012 14:31
Last Modified: 25 Jan 2017 09:41
URI: http://utpedia.utp.edu.my/id/eprint/3299

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...