Type of Document Dissertation Author Smith, Gregory Edward Author's Email Address email@example.com URN etd-08182006-164833 Title A Deterministic Approach to Partitioning Neural Network Training Data for the Classification Problem Degree PhD Department Business (Management Science) Advisory Committee
Advisor Name Title Ragsdale, Cliff T. Committee Chair Brown, Evelyn C. Committee Member Cook, Deborah F. Committee Member Rees, Loren Paul Committee Member Zobel, Christopher W. Committee Member Keywords
- convex sets
- discriminant analysis
- Neural networks
- data partitioning
Date of Defense 2006-08-07 Availability unrestricted Abstract
The classification problem in discriminant analysis involves identifying a function that accurately classifies observations as originating from one of two or more mutually exclusive groups. Because no single classification technique works best for all problems, many different techniques have been developed. For business applications, neural networks have become the most commonly used classification technique and though they often outperform traditional statistical classification methods, their performance may be hindered because of failings in the use of training data. This problem can be exacerbated because of small data set size.
In this dissertation, we identify and discuss a number of potential problems with typical random partitioning of neural network training data for the classification problem and introduce deterministic methods to partitioning that overcome these obstacles and improve classification accuracy on new validation data. A traditional statistical distance measure enables this deterministic partitioning. Heuristics for both the two-group classification problem and k-group classification problem are presented. We show that these heuristics result in generalizable neural network models that produce more accurate classification results, on average, than several commonly used classification techniques.
In addition, we compare several two-group simulated and real-world data sets with respect to the interior and boundary positions of observations within their groups' convex polyhedrons. We show by example that projecting the interior points of simulated data to the boundary of their group polyhedrons generates convex shapes similar to real-world data group convex polyhedrons. Our two-group deterministic partitioning heuristic is then applied to the repositioned simulated data, producing results superior to several commonly used classification techniques.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access GregorySmithDissertation.pdf 546.31 Kb 00:02:31 00:01:18 00:01:08 00:00:34 00:00:02
If you have questions or technical problems, please Contact DLA.