Skip to main content

Sequential Automatic Search of a Subset of Classifiers in Multiclass Learning

  • Conference paper
COMPSTAT 2008
  • 1203 Accesses

Abstract

A method called Sequential Automatic Search of a Subset of Classifiers is hereby introduced to deal with classification problems requiring decisions among a wide set of competing classes. It utilizes classifiers in a sequential way by restricting the number of competing classes while maintaining the presence of the true (class) outcome in the candidate set of classes. Some features of the method are discussed, namely: a cross-validation-based criteria to select the best classifier in each iteration of the algorithm, the resulting classification model and the possibility of choosing between an heuristic or probabilistic criteria to predict test set observations. Furthermore, the possibility to cast the whole method in the framework of unsupervised learning is also investigated. Advantages of the method are illustrated analyzing data from a letter recognition experiment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • ASUNCION, A., NEWMAN, D.J. (2008): UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences. Available via FTP: http://mlearn.ics.uci.edu/MLRepository.html.

  • BENABDESLEM, K., BENNANI, Y. (2006): Dendogram-based SVM for Multi-Class Classification. Journal of Computing and Information Technology - CIT 14, 283-289.

    Google Scholar 

  • BREIMAN, L. (2001): Random Forests. Machine Learning 45, 5-32.

    Article  MATH  Google Scholar 

  • BREIMAN, L. (1996): Bagging Predictors. Machine Learning 24, 123-140.

    MATH  MathSciNet  Google Scholar 

  • BREIMAN, L., FRIEDMAN, J.H., OLSHEN, R.A., STONE, C.J. (1984): Classification and regression trees. Wadsworth, Belmont (CA).

    MATH  Google Scholar 

  • CUTZU, F. (2003): Polychotomous Classification with Pairwise Classifiers: A New Voting Principle. In: T. Windeatt F. Roli (Eds.): Multiple Classifier System, Proceedings of the Fourth International Workshop MCS 2003. Springer-Verlag, New York, 115–124.

    Google Scholar 

  • DIETTERICH, T.G., BAKIRI, G. (1995): Solving multi-class learning problems via error-correcting output codes. Journal of Artificial Intelligence Research 2, 263–286.

    MATH  Google Scholar 

  • DUDA, R.O., HART, P.E., STORK, D.G. (2001): Pattern classification. John Wiley & Sons, New York.

    MATH  Google Scholar 

  • EVEN-ZOHAR, Y., ROTH, D. (2001): A Sequential Model for Multi-Class Classification. In: Lee, L., Harman, D. (Eds.): Proceedings of the 2001 Conference on Empirical Methods in Natural Language Processing. Available via FTP: www.cs.cornell.edu/home/llee/emnlp.html, 10–19.

  • FOGARTY, T. (1992): First Nearest Neighbor Classification on Frey and Slate’s Letter Recognition Problem (Technical Note). Machine Learning 9, 387–388.

    Google Scholar 

  • FREY, P.W., SLATE, D.J. (1991): Letter Recognition Using Holland-style Adaptive Classifiers. Machine Learning 6, 161–182.

    Google Scholar 

  • HASTIE, T.J., FRIEDMAN, J., TIBSHIRANI, R.J. (2001): The Elements of Statistical Learning. Springer, New York.

    MATH  Google Scholar 

  • HASTIE, T.J., TIBSHIRANI, R.J. (1998): Classification by pairwise coupling. The Annals of Statistics 26(1), 451-478.

    Article  MATH  MathSciNet  Google Scholar 

  • LEE, D., SEUNG, H. (1997): Unsupervised learning by convex and conic coding. In: Mozer, M.C., Jordan, M.I., Petsche, T. (Eds.): Advances in Neural Information Processing Systems. MIT press, Cambridge (MA), 9, 515–521.

    Google Scholar 

  • PRINZIE, A., VAN DEN POEL, D. (2005): Constrained optimization of datamining problems to improve model performance: a direct-marketing application. Expert Systems with Applications 29(3), 630–640.

    Article  Google Scholar 

  • R Development Core Team (2008): R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing. Vienna, Austria. Available via FTP: www.R-project.org.

  • SCHOLKOPF, B., SMOLA, A.H. (2001): Learning with Kernels. MIT press, Cambridge (MA).

    Google Scholar 

  • WESTON, J., HERBICH, R. (2000): Adaptive margin support vector machines. In: Smola, A.J., Bartlett, P.L., Scholkopf, B., Schuurmans, D. (Eds.): Advances in Large Margin Classifiers. MIT press, Cambridge (MA), 281–295.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Francesco Mola .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Physica-Verlag Heidelberg

About this paper

Cite this paper

Mola, F., Conversano, C. (2008). Sequential Automatic Search of a Subset of Classifiers in Multiclass Learning. In: Brito, P. (eds) COMPSTAT 2008. Physica-Verlag HD. https://doi.org/10.1007/978-3-7908-2084-3_24

Download citation

Publish with us

Policies and ethics