Skip to main content

A Probability Model for Combining Ranks

  • Conference paper
Multiple Classifier Systems (MCS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3541))

Included in the following conference series:

Abstract

Mixed Group Ranks is a parametric method for combining rank based classifiers that is effective for many-class problems. Its parametric structure combines qualities of voting methods with best rank approaches. InĀ [1] the parameters of MGR were estimated using a logistic loss function. In this paper we describe how MGR can be cast as a probability model. In particular we show that using an exponential probability model, an algorithm for efficient maximum likelihood estimation of its parameters can be devised. While casting MGR as an exponential probability model offers provable asymptotic properties (consistency), the interpretability of probabilities allows for flexiblity and natural integration of MGR mixture models.

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. Melnik, O., Vardi, Y., Zhang, C.H.: Mixed group ranks: Preference and confidence in classifier combination. IEEE Pattern Analysis and Machine IntelligenceĀ 26, 973ā€“981 (2004)

    ArticleĀ  Google ScholarĀ 

  2. Ho, T.K., Hull, J.J., Srihari, S.N.: Combination of decisions by multiple classifiers. In: Baird, H.S., Bunke, H. (eds.) Structured Document Image Analysis, pp. 188ā€“202. Springer, Heidelberg (1992)

    Google ScholarĀ 

  3. Bickel, P., Doksum, K.: Mathematical Statistics: Basic Ideas and Selected Topics. Prentice Hall, Englewood Cliffs (1977)

    MATHĀ  Google ScholarĀ 

  4. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)

    MATHĀ  Google ScholarĀ 

  5. Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)

    MATHĀ  Google ScholarĀ 

  6. Phillips, P., Moon, H., Rizvi, S., Rauss, P.: The feret evaluation methodology for face-recognition algorithms. IEEE Trans. on Pattern Analysis and Machine IntelligenceĀ 22 (2000)

    Google ScholarĀ 

  7. Moon, H., Phillips, P.: Computational and performance aspects of pca-based face-recognition algorithms. PerceptionĀ 30, 303ā€“321 (2001)

    ArticleĀ  Google ScholarĀ 

  8. Zhao, W., Krishnaswamy, A., Chellappa, R., Swets, D., Weng, J.: Discriminant Analysis of Principal Components. In: Face Recognition: From Theory to Applications, pp. 73ā€“86. Springer, Berlin (1998)

    Google ScholarĀ 

  9. Wiskott, L., Fellous, J.M., Kruger, N., von der Masburg, C.: Face recognition by elastic bunch graph matching. IEEE Transactions on Pattern Analysis and Machine IntelligenceĀ 17(7), 775ā€“779 (1997)

    ArticleĀ  Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Melnik, O., Vardi, Y., Zhang, CH. (2005). A Probability Model for Combining Ranks. In: Oza, N.C., Polikar, R., Kittler, J., Roli, F. (eds) Multiple Classifier Systems. MCS 2005. Lecture Notes in Computer Science, vol 3541. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494683_7

Download citation

  • DOI: https://doi.org/10.1007/11494683_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26306-7

  • Online ISBN: 978-3-540-31578-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics