Return to search

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 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.

Identiferoai:union.ndltd.org:TEXASAandM/oai:repository.tamu.edu:1969.1/1201
Date15 November 2004
CreatorsAttoor, Sanju Nair
ContributorsDougherty, Edward R., Serpedin, Erchin, Liu, Jyh-Charn, Narayanan, Krishna
PublisherTexas A&M University
Source SetsTexas A and M University
Languageen_US
Detected LanguageEnglish
TypeElectronic Thesis, text
Format276697 bytes, 53293 bytes, electronic, application/pdf, text/plain, born digital

Page generated in 0.0024 seconds