Several Robust Techniques In Two-Groups Unbiased Linear Classification

The fundamental difficulty in classification problem is how to assign an observation accurately to the group it belongs. This thesis is written based on the limitations and weaknesses of the Fisher linear classification analysis and its robust version based on the minimum covariance determinant e...

Full description

Bibliographic Details
Main Author: Okwonu, Friday Zinzendoff
Format: Thesis
Language:English
Published: 2013
Subjects:
Online Access:http://eprints.usm.my/43378/
http://eprints.usm.my/43378/1/Friday%20Zinzendoff%20Okwonu24.pdf
_version_ 1848879799323328512
author Okwonu, Friday Zinzendoff
author_facet Okwonu, Friday Zinzendoff
author_sort Okwonu, Friday Zinzendoff
building USM Institutional Repository
collection Online Access
description The fundamental difficulty in classification problem is how to assign an observation accurately to the group it belongs. This thesis is written based on the limitations and weaknesses of the Fisher linear classification analysis and its robust version based on the minimum covariance determinant estimator. The Fisher’s procedure is not robust while the robust version depends upon information obtained from the half set. This study develops several techniques to address the weaknesses of the two methods. They are: M linear classification rule, filter linear classification rule, weighted linear classification rule and linear combination linear classification rule. These procedures are developed in such a way that the influential observations are modeled alongside the regular observations. The robustness and stability of these techniques depends on the separation parameters. Contamination models and control variables were used to investigate the classification performance of these linear classification rules. Classification difference was used to compare the classification performance of the proposed techniques over the Fisher linear classification analysis and the Fisher linear classification analysis based on the minimum covariance determinant procedures. The mean probability of correct classification for each procedure was used to compare the mean of the optimal probability of correct classification obtained from the uncontaminated data set in order to ascertain robustness, breakdown and admissibility of these techniques.
first_indexed 2025-11-15T17:52:58Z
format Thesis
id usm-43378
institution Universiti Sains Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T17:52:58Z
publishDate 2013
recordtype eprints
repository_type Digital Repository
spelling usm-433782019-04-12T05:26:10Z http://eprints.usm.my/43378/ Several Robust Techniques In Two-Groups Unbiased Linear Classification Okwonu, Friday Zinzendoff QA1 Mathematics (General) The fundamental difficulty in classification problem is how to assign an observation accurately to the group it belongs. This thesis is written based on the limitations and weaknesses of the Fisher linear classification analysis and its robust version based on the minimum covariance determinant estimator. The Fisher’s procedure is not robust while the robust version depends upon information obtained from the half set. This study develops several techniques to address the weaknesses of the two methods. They are: M linear classification rule, filter linear classification rule, weighted linear classification rule and linear combination linear classification rule. These procedures are developed in such a way that the influential observations are modeled alongside the regular observations. The robustness and stability of these techniques depends on the separation parameters. Contamination models and control variables were used to investigate the classification performance of these linear classification rules. Classification difference was used to compare the classification performance of the proposed techniques over the Fisher linear classification analysis and the Fisher linear classification analysis based on the minimum covariance determinant procedures. The mean probability of correct classification for each procedure was used to compare the mean of the optimal probability of correct classification obtained from the uncontaminated data set in order to ascertain robustness, breakdown and admissibility of these techniques. 2013-10 Thesis NonPeerReviewed application/pdf en http://eprints.usm.my/43378/1/Friday%20Zinzendoff%20Okwonu24.pdf Okwonu, Friday Zinzendoff (2013) Several Robust Techniques In Two-Groups Unbiased Linear Classification. PhD thesis, Universiti Sains Malaysia.
spellingShingle QA1 Mathematics (General)
Okwonu, Friday Zinzendoff
Several Robust Techniques In Two-Groups Unbiased Linear Classification
title Several Robust Techniques In Two-Groups Unbiased Linear Classification
title_full Several Robust Techniques In Two-Groups Unbiased Linear Classification
title_fullStr Several Robust Techniques In Two-Groups Unbiased Linear Classification
title_full_unstemmed Several Robust Techniques In Two-Groups Unbiased Linear Classification
title_short Several Robust Techniques In Two-Groups Unbiased Linear Classification
title_sort several robust techniques in two-groups unbiased linear classification
topic QA1 Mathematics (General)
url http://eprints.usm.my/43378/
http://eprints.usm.my/43378/1/Friday%20Zinzendoff%20Okwonu24.pdf