By Topic

Analyzing the Performance of Hierarchical Binary Classifiers for Multi-class Classification Problem Using Biological Data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Begum, S. ; Comput. Sci. Dept., Univ. of Alabama in Huntsville, Huntsville, AL, USA ; Aygun, R.S.

Multi-class classification problem has become a challenging problem in bioinformatics research. The problem becomes more difficult as the number of classes increases. Decomposing the problem into a set of binary problems can be a good solution in some cases. One of the popular approaches is to build a hierarchical tree structure where a binary classifier is used at each node of the tree. This paper proposes a new greedy technique for building a hierarchical binary classifier to solve multiclass problem. We use neural networks to build all possible binary classifiers and use this greedy strategy to build the hierarchical tree. This technique is evaluated and compared with two popular standard approaches One-Versus-All, One-Versus-One and a multi-class single neural network based classifier. In addition, these techniques are compared with an exhaustive approach that utilizes all possible binary classifiers to analyze how close those classifiers perform to the exhaustive method.

Published in:

Machine Learning and Applications (ICMLA), 2012 11th International Conference on  (Volume:2 )

Date of Conference:

12-15 Dec. 2012