ERA

Download the full-sized PDF of A data clustering algorithm for stratified data partitioning in artificial neural networkDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3X881

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

A data clustering algorithm for stratified data partitioning in artificial neural network Open Access

Descriptions

Other title
Subject/Keyword
data partitioning
artificial neural network
data clustering algorithm
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Sahoo, Ajit Kumar
Supervisor and department
Zuo, Ming J. (Mechanical Engineering)
Examining committee member and department
Kumar, Amit (Mechanical Engineering)
Mohamed, Yasser (Construction Engineering and Management )
Department
Department of Mechanical Engineering
Specialization

Date accepted
2011-01-05T19:36:02Z
Graduation date
2011-06
Degree
Master of Science
Degree level
Master's
Abstract
The statistical properties of training, validation and test data play an important role in assuring optimal performance in artificial neural networks (ANN). Re-searchers have proposed randomized data partitioning (RDP) and stratified data partitioning (SDP) methods for partition of input data into training, vali-dation and test datasets. RDP methods based on genetic algorithm (GA) are computationally expensive as the random search space can be in the power of twenty or more for an average sized dataset. For SDP methods, clustering al-gorithms such as self organizing map (SOM) and fuzzy clustering (FC) are used to form strata. It is assumed that data points in any individual stratum are in close statistical agreement. Reported clustering algorithms are designed to form natural clusters. In the case of large multivariate datasets, some of these natural clusters can be big enough such that the furthest data vectors are statis-tically far away from the mean. Further, these algorithms are computationally expensive as well. Here a custom design clustering algorithm (CDCA) has been proposed to overcome these shortcomings. Comparisons have been made using three benchmark case studies, one each from classification, function ap-proximation and prediction domain respectively. The proposed CDCA data partitioning method was evaluated in comparison with SOM, FC and GA based data partitioning methods. It was found that the CDCA data partitioning method not only performed well but also reduced the average CPU time.
Language
English
DOI
doi:10.7939/R3X881
Rights
License granted by Ajit Sahoo (sahoo@ualberta.ca) on 2010-12-23T19:51:19Z (GMT): Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
2014-04-29T20:18:11.141+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 1936974
Last modified: 2015:10:12 19:44:56-06:00
Filename: Sahoo_Ajit_Spring 2011.pdf
Original checksum: 7c5df4ce215ccbda2117a5af68de1156
Well formed: true
Valid: true
File title: Title Page
File title: Research Proposal
File author: sahoo
Page count: 114
Activity of users you follow
User Activity Date