Skip to main content
SpringerLink
Log in

Constructing Dynamic Frames of Discernment in Cases of Large Number of Classes

  • Conference paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6717))

Abstract

The Dempster-Shafer theory (DST) is particularly interesting to deal with imprecise information. However, it is known for its high computational cost, as dealing with a frame of discernment Ω involves the manipulation of up to 2|Ω| elements. Hence, classification problems where the number of classes is too large cannot be considered. In this paper, we propose to take advantage of a context of ensemble classification to construct a frame of discernment where only a subset of classes is considered. We apply this method to script recognition problems, which by nature involve a tremendous number of classes.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Shafer, G.: A Mathematical Theory of Evidence, Princeton, edn. Princeton University Press, Princeton (1976)

    MATH  Google Scholar 

  2. Smets, P., Kennes, R.: The transferable belief model. Artificial Intelligence 66(2), 191–234 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Voorbraak, F.: A computationally efficient approximation of Dempster-Shafer theory. International Journal on Man-Machine Studies 30, 525–536 (1989)

    Article  MATH  Google Scholar 

  4. Dubois, D., Prade, H., Smets, P.: New semantics for quantitative possibility theory. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 410–421. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Grabisch, M.: K-order additive discrete fuzzy measures and their representation. Fuzzy Sets and Systems 92, 167–189 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Masson, M.-H., Denoeux, T.: Belief functions and cluster ensembles. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol. 5590, pp. 323–334. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Denoeux, T., Yaghlane, A.B.: Approximating the combination of belief functions using the fast moebius transform in a coarsened frame. International Journal of Approximate Reasoning 31(1-2), 77–101 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Janez, F., Appriou, A.: Theory of evidence and non-exhaustive frames of discernment: Plausibilities correction methods. International Journal of Approximate Reasoning 18(1-2), 1–19 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Schubert, J.: Constructing and Reasoning about Alternative Frames of Discernment. In: Proceedings of the Workshop on the Theory of Belief Functions (2010)

    Google Scholar 

  10. Rabiner, L.R.: A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE, 257–286 (1989)

    Google Scholar 

  11. Xu, L., Krzyzak, A., Suen, C.: Methods of combining multiple classifiers and their applications to handwriting recognition. IEEE Trans. Syst., Man, Cybern. (3) (1992)

    Google Scholar 

  12. Kim, J.H., Kim, K.K., Nadal, C.P., Suen, C.Y.: A methodology of combining hmm and mlp classifiers for cursive word recognition. In: International Conference on Pattern Recognition, vol. 2, pp. 319–322 (2000)

    Google Scholar 

  13. Prevost, L., Michel-Sendis, C., Moises, A., Oudot, L., Milgram, M.: Combining model-based and discriminative classifiers: application to handwritten character recognition. In: International Conference on Document Analysis and Recognition, vol. 1, pp. 31–35 (2003)

    Google Scholar 

  14. Arica, N., Yarman-Vural, F.T.: An overview of character recognition focused on off-line handwriting. IEEE Trans. Systems, Man and Cybernetics, Part C: Applications and Reviews (2), 216–232 (2001)

    Google Scholar 

  15. Kessentini, Y., Paquet, T., Hamadou, A.B.: Off-line handwritten word recognition using multi-stream hidden markov models. Pattern Recognition Letters 30(1), 60–70 (2010)

    Article  Google Scholar 

  16. Kessentini, Y., Paquet, T., Burger, T.: Comparaison des méthodes probabilistes et évidentielles de fusion de classifieurs pour la reconnaissance de mots manuscrits. In: CIFED (2010)

    Google Scholar 

  17. Kessentini, Y., Burger, T., Paquet, T.: Evidential ensemble hmm classifier for handwriting recognition. In: Proceedings of IPMU, vol. 6178, pp. 445–454 (2010)

    Google Scholar 

  18. Al-Ani, A., Deriche, M.: A new technique for combining multiple classifiers using the Dempster-Shafer theory of evidence. Journal of Artificial Intelligence Research 17(1), 333–361 (2002)

    MathSciNet  MATH  Google Scholar 

  19. Altınçay, H.: A dempster-shafer theoretic framework for boosting based ensemble design. Pattern Analysis & Applications 8(3), 287–302 (2005)

    Article  MathSciNet  Google Scholar 

  20. Burger, T., Aran, O., Caplier, A.: Modeling hesitation and conflict: A belief-based approach for multi-class problems. In: Fourth International Conference on Machine Learning and Applications, pp. 95–100 (2006)

    Google Scholar 

  21. Mercier, D., Cron, G., Denoeux, T., Masson, M.-H.: Fusion de décisions postales dans le cadre du modéle des croyances transférables. Traitement du Signal 24(2), 133–151 (2007)

    Google Scholar 

  22. Valente, F., Hermansky, H.: Combination of acoustic classifiers based on dempster-shafer theory of evidence. In: IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, vol. 4, pp. 1129–1132 (April 2007)

    Google Scholar 

  23. Burger, T., Aran, O., Urankar, A., Akarun, L., Caplier, A.: A dempster-shafer theory based combination of classifiers for hand gesture recognition. In: Computer Vision and Computer Graphics - Theory and Applications. CCIS (2008)

    Google Scholar 

  24. Bi, Y., Guan, J., Bell, D.A.: The combination of multiple classifiers using an evidential reasoning approach. Artif. Intell. 172(15), 1731–1751 (2008)

    Article  MATH  Google Scholar 

  25. Aran, O., Burger, T., Caplier, A., Akarun, L.: A belief-based sequential fusion approach for fusing manual and non-manual signs. Pattern Recognition 42(5), 812–822 (2009)

    Article  MATH  Google Scholar 

  26. Burger, T., Kessentini, Y., Paquet, T.: A tutorial on using dempster-shafer theory to combine probabilistic classifiers - application to hand gesture and handwriting recognition. Submitted to Journal of Zhejiang University, Elsevier (2011)

    Google Scholar 

  27. Haenni, R.: Are alternatives to Dempsterís rule of combination alternatives. Int. J. Information Fusion 3, 237–241 (2002)

    Article  Google Scholar 

  28. Quost, B., Masson, M., Denoeux, T.: Classifier fusion in the Dempster-Shafer framework using optimized t-norm based combination rules. International Journal of Approximate Reasoning (2010)

    Google Scholar 

  29. Pechwitz, M., Maddouri, S., Maergner, V., Ellouze, N., Amiri, H.: Ifn/enit - database of handwritten arabic words. Colloque International Francophone sur l’Ecrit et le Doucement, 129–136 (2002)

    Google Scholar 

  30. Grosicki, E., Carre, M., Brodin, J., Geoffrois, E.: Results of the rimes evaluation campaign for handwritten mail processing. In: International Conference on Document Analysis and Recognition, pp. 941–945 (2009)

    Google Scholar 

  31. McNemar, Q.: Note on the sampling error of the difference between correlated proportions or percentages. Psychometrika 12(2), 153–157 (1947)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LITIS, Université de Rouen, EA 4108, site du Madrillet, St Etienne du, Rouvray, France

    Yousri Kessentini & Thierry Paquet

  2. Université de Bretagne-Sud, CNRS, Lab-STICC, Université Européenne de Bretagne, F-56017, Vannes cedex, France

    Thomas Burger

Authors
  1. Yousri Kessentini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Burger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thierry Paquet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electronics, Electrical Engineering and Computer Science, Queen’s University Belfast, BT9 5BN, Belfast, UK

    Weiru Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kessentini, Y., Burger, T., Paquet, T. (2011). Constructing Dynamic Frames of Discernment in Cases of Large Number of Classes. In: Liu, W. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2011. Lecture Notes in Computer Science(), vol 6717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22152-1_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22152-1_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22151-4

  • Online ISBN: 978-3-642-22152-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation