ACM Home Page
Please provide us with feedback. Feedback
Scaling multi-class support vector machines using inter-class confusion
Full text pdf formatPdf (675 KB)
Source Conference on Knowledge Discovery in Data archive
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Edmonton, Alberta, Canada
POSTER SESSION: Poster papers table of contents
Pages: 513 - 518  
Year of Publication: 2002
ISBN:1-58113-567-X
Authors
Shantanu Godbole  IIT Bombay
Sunita Sarawagi  IIT Bombay
Soumen Chakrabarti  IIT Bombay
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
: AAAI
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 34,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775047.775122
What is a DOI?

ABSTRACT

Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative models, such as the naïve Bayes (NB) classifier. On the other hand, generative classifiers have no trouble in handling an arbitrary number of classes efficiently, and NB classifiers train much faster than SVMs owing to their extreme simplicity. In contrast, SVMs handle multi-class problems by learning redundant yes/no (one-vs-others) classifiers for each class, further worsening the performance gap. We propose a new technique for multi-way classification which exploits the accuracy of SVMs and the speed of NB classifiers. We first use a NB classifier to quickly compute a confusion matrix, which is used to reduce the number and complexity of the two-class SVMs that are built in the second stage. During testing, we first get the prediction of a NB classifier and use that to selectively apply only a subset of the two-class SVMs. On standard benchmarks, our algorithm is 3 to 6 times faster than SVMs and yet matches or even exceeds their accuracy.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
T. G. Dietterich and G. Bakiri. Solving multiclass learning problems via ECOCs. JAIR, 2:263--286, 1995.
4
 
5
 
6
Shantanu Godbole. Exploiting confusion matrices for automatic generation of topic hierarchies and scaling up multi-way classifiers. Technical Report, IIT Bombay, 2002. http://www.it.iitb.ac.in/~shantanu/work/aps2002.pdf
 
7
Ryan Rifkin and Jason D. M. Rennie. Improving multi-class text classification with the support vector machine, AI Memo, AIM-2001-026, MIT, 2001.
8
 
9
 
10
 
11
T. M. Mitchell. Conditions for the equivalence of hierarchical and non-hierarchical Bayesian classifiers. Technical note, 1998. Online at http://www.cs.cmu.edu/~tom/hierproof.ps
 
12
J. Platt, N. Cristianini, and J. Shawe-Taylor. Large margin DAGs for multiclass classification. In Advances in NIPS 12, MIT Press, 2000.
 
13
M. F. Porter. An algorithm for suffix stripping. Program, 14(3):130--137, 1980.
 
14


Collaborative Colleagues:
Shantanu Godbole: colleagues
Sunita Sarawagi: colleagues
Soumen Chakrabarti: colleagues

Peer to Peer - Readers of this Article have also read: