Imperfect Labels with Belief Functions for Active Learning | SpringerLink
Skip to main content

Imperfect Labels with Belief Functions for Active Learning

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

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

Included in the following conference series:

Abstract

Classification is used to predict classes by extracting information from labeled data. But sometimes the collected data is imperfect, as in crowdsourcing where users have partial knowledge and may answer with uncertainty or imprecision. This paper offers a way to deal with uncertain and imprecise labeled data using Dempster-Shafer theory and active learning. An evidential version of K-NN that classifies a new example by observing its neighbors was earlier introduced. We propose to couple this approach with active learning, where the model uses only a fraction of the labeled data, and to compare it with non-evidential models. A new computable parameter for EK-NN is introduced, allowing the model to be both compatible with imperfectly labeled data and equivalent to its first version in the case of perfectly labeled data. This method increases the complexity but provides a way to work with imperfectly labeled data with efficient results and reduced labeling costs when coupled with active learning. We have conducted tests on real data imperfectly labeled during crowdsourcing campaigns.

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

    https://archive.ics.uci.edu.

  2. 2.

    Formula: \([\bar{x} - {\scriptstyle 1,96}\frac{\mathcal {S}}{\sqrt{n}}; \bar{x} + {\scriptstyle 1,96}\frac{\mathcal {S}}{\sqrt{n}}]\), with n the size of the sample, \(\bar{x}\) its mean and \(\mathcal {S}\) the standard deviation of the serie. This formula is used because it is a mean over 100 experiments and not a single proportion.

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. Denoeux, T., Kanjanatarakul, O., Sriboonchitta, S.: A new evidential k-nearest neighbor rule based on contextual discounting with partially supervised learning. Int. J. Approximate Reasoning 113, 287–302 (2019)

    Article  MathSciNet  Google Scholar 

  3. Denæux, T.: A k-nearest neighbor classification rule based on dempster-shafer theory. IEEE Trans. Syst. Man Cybern. 219(1995)

    Google Scholar 

  4. Denæux, T., Zouhal, L.: Handling possibilistic labels in pattern classification using evidential reasoning. Fuzzy Sets Syst. 122, 409–424 (2001)

    Google Scholar 

  5. Dudani, S.A.: The distance-weighted k-nearest-neighbor rule. IEEE Trans. Syst. Man Cybern. SMC 6(4), 325–327 (1976)

    Google Scholar 

  6. Fix, E., Hodges, J.L.: Discriminatory analysis. nonparametric discrimination: Consistency properties. Technical report 4. USAF, School of Aviation Medicine, Randolph Field (1951)

    Google Scholar 

  7. Fredriksson, T., Mattos, D.I., Bosch, J., Olsson, H.H.: Data labeling: an empirical investigation into industrial challenges and mitigation strategies. In: Morisio, M., Torchiano, M., Jedlitschka, A. (eds.) Product-Focused Software Process Improvement, pp. 202–216. Springer International Publishing, Cham (2020). https://doi.org/10.1007/978-3-030-64148-1_13

    Chapter  Google Scholar 

  8. 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 

  9. Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825–2830 (2011)

    MathSciNet  MATH  Google Scholar 

  10. Roh, Y., Heo, G., Whang, S.E.: A survey on data collection for machine learning: a big data - AI integration perspective. IEEE Trans. Knowl. Data Eng. 33(4), 1328–1347 (2021)

    Article  Google Scholar 

  11. Settles, B.: Active learning literature survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison (2009)

    Google Scholar 

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

    Book  Google Scholar 

  13. Thierry, C., Hoarau, A., Martin, A., Dubois, J.C., Le Gall, Y.: Real bird dataset with imprecise and uncertain values. In: 7th International Conference on Belief Functions (2022)

    Google Scholar 

  14. Zhu, D., Martin, A., Le Gall, Y., Dubois, J.C., Lemaire, V.: Evidential nearest neighbours in active learning. In: Worksop on Interactive Adaptive Learning (IAL) - ECML-PKDD. Bilbao, Spain (2021)

    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

© 2022 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., Martin, A., Dubois, JC., Le Gall, Y. (2022). Imperfect Labels with Belief Functions for Active Learning. In: Le Hégarat-Mascle, S., Bloch, I., Aldea, E. (eds) Belief Functions: Theory and Applications. BELIEF 2022. Lecture Notes in Computer Science(), vol 13506. Springer, Cham. https://doi.org/10.1007/978-3-031-17801-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-17801-6_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-17800-9

  • Online ISBN: 978-3-031-17801-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics