Soft tree building in a binary hierarchical classifier framework

dc.contributor.advisorCrawford, Melba M.
dc.contributor.advisorGhosh, Joydeep
dc.creatorGupta, Ankur P.
dc.date.accessioned2019-09-20T23:03:14Z
dc.date.available2019-09-20T23:03:14Z
dc.date.issued2004-08-16
dc.description.abstractClassification problems in remote sensing are often difficult because of high dimensionality of the input space, large number of class labels, overlapping class distributions, and limited quantity of training data. Various modular learning techniques have been developed that decompose the classification problem into simpler sub-problems in either the input space or the output space or both. The Binary Hierarchical Classifier (BHC) is a hierarchical modular learning framework that decomposes a ̀C' class problem in the output space. The BHC has the capability of automatically revealing the inherent taxonomy of classes according to the class separation determined by the linear discriminant. In this thesis, a new approach called the Binary Hierarchical Classifier-Soft Tree Build (BHC-STB) has been developed that provides the capability for each class to softly associate with more than one node. The algorithm seeks to partition the given set of classes into two overlapping sets in such a way that classes that are similar to each other, but dissimilar from the classes in the other set are assigned to one of the two sets, while classes that are similar to the members of both these groups (or dissimilar from the members of both the groups) are assigned to both sets with some probability. The process is recursively repeated until each set contains only one class. The soft tree build framework enhances the BHC framework for problems with mixed classes that share characteristics with both the child nodes or distinct classes that do not associate easily with one or the other child node. The proposed method shows improvement in classification accuracy for difficult problems with mixed classes and also reveals the enhanced domain knowledge compared to the BHC.en_US
dc.description.departmentOperations Research and Industrial Engineeringen_US
dc.format.mediumelectronicen_US
dc.identifier.urihttps://hdl.handle.net/2152/75929
dc.identifier.urihttp://dx.doi.org/10.26153/tsw/3028
dc.language.isoengen_US
dc.relation.ispartofUT Electronic Theses and Dissertationsen_US
dc.rightsCopyright © is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works.en_US
dc.rights.restrictionRestricteden_US
dc.subjectBinary Hierarchical Classifieren_US
dc.subjectDataset descriptionen_US
dc.titleSoft tree building in a binary hierarchical classifier frameworken_US
dc.typeThesisen_US
dc.type.genreThesisen_US
thesis.degree.departmentOperations Research and Industrial Engineeringen_US
thesis.degree.disciplineOperations Research and Industrial Engineeringen_US
thesis.degree.grantorUniversity of Texas at Austinen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Science in Engineering.en_US

Access full-text files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
txu-oclc-58477544.pdf
Size:
438.66 KB
Format:
Adobe Portable Document Format
Description:
Access restricted to UT Austin EID holders

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.64 KB
Format:
Item-specific license agreed upon to submission
Description: