Skip to main content

Polychotomous Classification with Pairwise Classifiers: A New Voting Principle

  • Conference paper
  • First Online:
Multiple Classifier Systems (MCS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2709))

Included in the following conference series:

Abstract

A new principle for performing polychotomous classification with pairwise classifiers is introduced: if pairwise classifier \( \mathcal{N}_{ij} \), trained to discriminate between classes i and j, responds ā€œiā€ for an input x from an unknown class (not necessarily i or j), one can at best conclude that x āˆ‰ j. Thus, the output of pairwise classifier \( \mathcal{N}_{ij} \) can be interpreted as a vote against the losing class j, and not, as existing methods propose, as a vote for the winning class i. Both a discrete and a continuous classification model derived from this principle are introduced.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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

  1. Erin L. Allwein, Robert E. Schapire, and Yoram Singer. Reducing multiclass to binary: A unifying approach for margin classifiers. In Proc. 17th International Conf. on Machine Learning, pages 9ā€“16. Morgan Kaufmann, San Francisco, CA, 2000.

    Google ScholarĀ 

  2. Jerome H. Friedman. Another approach to polychotomous classification. Technical report, Stanford University, 1996.

    Google ScholarĀ 

  3. Trevor Hastie and Robert Tibshirani. Classification by pairwise coupling. In Michael I. Jordan, Michael J. Kearns, and Sara A. Solla, editors, Advances in Neural Information Processing Systems, volume 10. The MIT Press, 1998.

    Google ScholarĀ 

  4. Eddy Mayoraz and Ethem Alpaydin. Support vector machines for multi-class classification. In IWANN (2), pages 833ā€“842, 1999.

    Google ScholarĀ 

  5. Volker Roth. Probabilistic discriminative kernel classifiers for multi-class problems. Lecture Notes in Computer Science, 2191:246ā€“266, 2001.

    ArticleĀ  Google ScholarĀ 

  6. JĆ¼rgen SchĆ¼rmann. Patern Classification. A Unified View of Statistical and Neural Principles. John Wiley & Sons, Inc, New York, NA, 1996.

    Google ScholarĀ 

  7. B. Zadrozny. Reducing multiclass to binary by coupling probability estimates, 2001.

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cutzu, F. (2003). Polychotomous Classification with Pairwise Classifiers: A New Voting Principle. In: Windeatt, T., Roli, F. (eds) Multiple Classifier Systems. MCS 2003. Lecture Notes in Computer Science, vol 2709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44938-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-44938-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40369-2

  • Online ISBN: 978-3-540-44938-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics