Show simple item record

Optimal Information-based Classification.

dc.contributor.authorHyun, Baroen_US
dc.date.accessioned2011-09-15T17:18:15Z
dc.date.availableNO_RESTRICTIONen_US
dc.date.available2011-09-15T17:18:15Z
dc.date.issued2011en_US
dc.date.submitteden_US
dc.identifier.urihttps://hdl.handle.net/2027.42/86523
dc.description.abstractClassification is the allocation of an object to an existing category among several based on uncertain measurements. Since information is used to quantify uncertainty, it is natural to consider classification and information as complementary subjects. This dissertation touches upon several topics that relate to the problem of classification, such as information, classification, and team classification. Motivated by the U.S. Air Force Intelligence, Surveillance, and Reconnaissance missions, we investigate the aforementioned topics for classifiers that follow two models: classifiers with workload-independent and workload-dependent performance. We adopt workload-independence and dependence as "first-order" models to capture the features of machines and humans, respectively. We first investigate the relationship between information in the sense of Shannon and classification performance, which is defined as the probability of misclassification. We show that while there is a predominant congruence between them, there are cases when such congruence is violated. We show the phenomenon for both workload-independent and workload-dependent classifiers and investigate the cause of such phenomena analytically. One way of making classification decisions is by setting a threshold on a measured quantity. For instance, if a measurement falls on one side of the threshold, the object that provided the measurement is classified as one type, otherwise, it is of another type. Exploiting thresholding, we formalize a classifier with dichotomous decisions (i.e., with two options, such as true or false) given a single variable measurement. We further extend the formalization to classifiers with trichotomy (i.e., with three options, such as true, false or unknown) and with multivariate measurements. When a team of classifiers is considered, issues on how to exploit redundant numbers of classifiers arise. We analyze these classifiers under different architectures, such as parallel or nested. First, we consider a team of homogeneous (identical) classifiers and provide a fusion-rule, supervisor-based strategy using a parallel architecture. Then, we consider a team of heterogeneous classifiers and provide a strategy using a nested architecture. We show results that confirm that both strategies outperform a single classifier.en_US
dc.language.isoen_USen_US
dc.subjectInformationen_US
dc.subjectOptimal Classificationen_US
dc.subjectTeam Classificationen_US
dc.titleOptimal Information-based Classification.en_US
dc.typeThesisen_US
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineAerospace Engineeringen_US
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studiesen_US
dc.contributor.committeememberGirard, Anouck Reneeen_US
dc.contributor.committeememberKabamba, Pierre Tshimangaen_US
dc.contributor.committeememberAbdelhafiz, Mariam F.en_US
dc.contributor.committeememberCummings, Mary L.en_US
dc.contributor.committeememberUlsoy, A. Galipen_US
dc.subject.hlbsecondlevelAerospace Engineeringen_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/86523/1/bhyun_1.pdf
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.