A Mean Distance Between Elements of Same Class for Rich Labels | SpringerLink
Skip to main content

A Mean Distance Between Elements of Same Class for Rich Labels

  • Conference paper
  • First Online:
Belief Functions: Theory and Applications (BELIEF 2024)

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

Included in the following conference series:

  • 163 Accesses

Abstract

The prevalence of imperfections in data, characterized by uncertainty and imprecision, prompts the need for effective modeling techniques. The theory of belief functions offers a mathematical framework to address this challenge. In this paper, we tackle the problem of calculating the mean distance between elements of the same class, especially when class membership is uncertain and imprecise. Leveraging belief functions and a notion of similarity between elements, we propose a solution and validate its efficacy through experimental evaluations. The proposed method proves effective when labels exhibit low imprecision, whereas unsupervised methods may be more effective for labels closer to complete ignorance.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 7550
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 8293
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

Notes

  1. 1.

    Homogeneity is represented by the mean distance between students of the same class.

  2. 2.

    Grades are: \(A, A^-, B^+, B, B^-, C^+, C, C^-, D^+, D, D^-, F\).

  3. 3.

    For the class that maximizes the pignistic probability, the mean distances are 9.3 for class 1 and 7.8 for class 2.

  4. 4.

    The first class present in each dataset is always depicted.

References

  1. Dempster, A.P.: Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Stat. 38(2), 325–339 (1967)

    Article  MathSciNet  Google Scholar 

  2. Denœux, T., Kanjanatarakul, O.: Evidential clustering: a review. In: Huynh, V.N., Inuiguchi, M., Le, B., Le, B.N., Denoeux, T. (eds.) Integrated Uncertainty in Knowledge Modelling and Decision Making, pp. 24–35 (2016)

    Google Scholar 

  3. Hoarau, A., Martin, A., Dubois, J.C., Le Gall, Y.: Imperfect labels with belief functions for active learning. In: Le Hegarat-Mascle, S., Bloch, I., Aldea, E. (eds.) BELIEF 2022. LNCS, vol. 13506, pp. 44–53. Springer, Heidelberg (2022). https://doi.org/10.1007/978-3-031-17801-6_5

    Chapter  Google Scholar 

  4. Jousselme, A.L., Grenier, D.: Éloi Bossé: a new distance between two bodies of evidence. Inf. Fusion 2(2), 91–101 (2001)

    Article  Google Scholar 

  5. Jousselme, A.L., Maupin, P.: Distances in evidence theory: comprehensive survey and generalizations. Int. J. Appro. Reason. 53(2), 118–145 (2012)

    Article  MathSciNet  Google Scholar 

  6. Liu, Z., Pan, Q., Dezert, J., Martin, A.: Adaptive imputation of missing values for incomplete pattern classification. Pattern Recogn. 52, 85–95 (2016)

    Article  Google Scholar 

  7. Masson, M.H., Denæux, T.: ECM: an evidential version of the fuzzy c-means algorithm. Pattern Recogn. 41(4), 1384–1397 (2008)

    Article  Google Scholar 

  8. Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)

    Book  Google Scholar 

  9. Smets, P.: Imperfect information: imprecision and uncertainty. In: Motro, A., Smets, P. (eds.) Uncertainty Management in Information Systems, pp. 225–254. Springer, Boston (1997). https://doi.org/10.1007/978-1-4615-6245-0_8

    Chapter  Google Scholar 

  10. Zhang, Y., Destercke, S., Zhang, Z., Bouadi, T., Martin, A.: On computing evidential centroid through conjunctive combination: an impossibility theorem. IEEE Trans. Artif. Intell. 43, 487–496 (2022)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arthur Hoarau .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hoarau, A., Thierry, C., Dubois, JC., Le Gall, Y. (2024). A Mean Distance Between Elements of Same Class for Rich Labels. In: Bi, Y., Jousselme, AL., Denoeux, T. (eds) Belief Functions: Theory and Applications. BELIEF 2024. Lecture Notes in Computer Science(), vol 14909. Springer, Cham. https://doi.org/10.1007/978-3-031-67977-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-67977-3_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-67976-6

  • Online ISBN: 978-3-031-67977-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics