Relationship between classifier performance and distributional complexity for small samples
Given a limited number of samples for classification, several issues arise with respect to design, performance and analysis of classifiers. This is especially so in the case of microarray-based classification. In this paper, we use a complexity measure based mixture model to study classifier perform...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
Texas A&M University
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1969.1/1201 |
id |
ndltd-tamu.edu-oai-repository.tamu.edu-1969.1-1201 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-tamu.edu-oai-repository.tamu.edu-1969.1-12012013-01-08T10:37:30ZRelationship between classifier performance and distributional complexity for small samplesAttoor, Sanju Nairclassifiersmall sampledistributional complexityVC dimensionGiven a limited number of samples for classification, several issues arise with respect to design, performance and analysis of classifiers. This is especially so in the case of microarray-based classification. In this paper, we use a complexity measure based mixture model to study classifier performance for small sample problems. The motivation behind such a study is to determine the conditions under which a certain class of classifiers is suitable for classification, subject to the constraint of a limited number of samples being available. Classifier study in terms of the VC dimension of a learning machine is also discussed.Texas A&M UniversityDougherty, Edward R.2004-11-15T19:49:46Z2004-11-15T19:49:46Z2003-082004-11-15T19:49:46ZBookThesisElectronic Thesistext276697 bytes53293 byteselectronicapplication/pdftext/plainborn digitalhttp://hdl.handle.net/1969.1/1201en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
topic |
classifier small sample distributional complexity VC dimension |
spellingShingle |
classifier small sample distributional complexity VC dimension Attoor, Sanju Nair Relationship between classifier performance and distributional complexity for small samples |
description |
Given a limited number of samples for classification, several issues arise with respect to design, performance and analysis of classifiers. This is especially so in the case of microarray-based classification. In this paper, we use a complexity measure based mixture model to study classifier performance for small sample problems. The motivation behind such a study is to determine the conditions under which a certain class of classifiers is suitable for classification, subject to the constraint of a limited number of samples being available. Classifier study in terms of the VC dimension of a learning machine is also discussed. |
author2 |
Dougherty, Edward R. |
author_facet |
Dougherty, Edward R. Attoor, Sanju Nair |
author |
Attoor, Sanju Nair |
author_sort |
Attoor, Sanju Nair |
title |
Relationship between classifier performance and distributional complexity for small samples |
title_short |
Relationship between classifier performance and distributional complexity for small samples |
title_full |
Relationship between classifier performance and distributional complexity for small samples |
title_fullStr |
Relationship between classifier performance and distributional complexity for small samples |
title_full_unstemmed |
Relationship between classifier performance and distributional complexity for small samples |
title_sort |
relationship between classifier performance and distributional complexity for small samples |
publisher |
Texas A&M University |
publishDate |
2004 |
url |
http://hdl.handle.net/1969.1/1201 |
work_keys_str_mv |
AT attoorsanjunair relationshipbetweenclassifierperformanceanddistributionalcomplexityforsmallsamples |
_version_ |
1716502707916767232 |