Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
ucin1003516324.pdf (447.82 KB)
ETD Abstract Container
Abstract Header
A New Measure of Classifiability and its Applications
Author Info
Dong, Ming
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1003516324
Abstract Details
Year and Degree
2001, PhD, University of Cincinnati, Engineering : Electrical Engineering.
Abstract
Characterizing the difficulty of a pattern classification problem is an open and challenging problem in machine learning. While some progress has been made in understanding the difficulty of learning a concept (as in the PAC learning framework), the more pertinent and challenging problem of characterizing the difficulty of a problem given a specific and finite sample has not been addressed. In this dissertation we develop a new measure of classifiability, motivated in part by the fact that a n-dimensional classification problem may be visualized in (n+1) dimensions using the class label as the (n+1)
th
dimension. In such a visualization, the class label provides a surface which is smooth in regions where classes are non-interlaced and rough in regions where classes are interlaced. The texture of the "class label surface" thus provides an intuitive measure of pattern classifiability. We establish Bayes-sense optimality of the proposed measure of classifiability and present some experimental results based on a simple algorithm to compute the proposed classifiability measure. The new classifiability measure can be used broadly in solving classification problems since it not only considers the number of pattern instances of different classes (purity) at current situation, but also the spatial distribution of these instances to estimate the effect of further classification. In this dissertation, we develop new approaches for crisp and fuzzy decision tree induction, decision pre-pruning as well as feature subset selection based on the classifiability measure. The proposed algorithms outperform existing algorithms on several standard testing datasets as well as ona real world problem: evaluating skin condition.
Committee
Dr. Ravi Kothari (Advisor)
Pages
101 p.
Keywords
pattern recognition and classification
;
classifiability
;
Bayes Error
;
decision tree
;
feature subset selection
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Dong, M. (2001).
A New Measure of Classifiability and its Applications
[Doctoral dissertation, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1003516324
APA Style (7th edition)
Dong, Ming.
A New Measure of Classifiability and its Applications.
2001. University of Cincinnati, Doctoral dissertation.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1003516324.
MLA Style (8th edition)
Dong, Ming. "A New Measure of Classifiability and its Applications." Doctoral dissertation, University of Cincinnati, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1003516324
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
ucin1003516324
Download Count:
1,069
Copyright Info
© 2001, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.