Hierarchical Maximum Margin Learning for Multi-Class Classification

Details Hierarchical Maximum Margin Learning for Multi-Class Classification Hierarchical Maximum Margin Learning for Multi-Class Classification

2012-02-14

arxiv.org/abs/1202.3770v1

Computer Science

Learning

Scientific paper

Due to myriads of classes, designing accurate and efficient classifiers becomes very challenging for multi-class classification. Recent research has shown that class structure learning can greatly facilitate multi-class learning. In this paper, we propose a novel method to learn the class structure for multi-class classification problems. The class structure is assumed to be a binary hierarchical tree. To learn such a tree, we propose a maximum separating margin method to determine the child nodes of any internal node. The proposed method ensures that two classgroups represented by any two sibling nodes are most separable. In the experiments, we evaluate the accuracy and efficiency of the proposed method over other multi-class classification methods on real world large-scale problems. The results show that the proposed method outperforms benchmark methods in terms of accuracy for most datasets and performs comparably with other class structure learning methods in terms of efficiency for all datasets.

Affiliated with

Also associated with

No associations

Rating

Hierarchical Maximum Margin Learning for Multi-Class Classification does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hierarchical Maximum Margin Learning for Multi-Class Classification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical Maximum Margin Learning for Multi-Class Classification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90729