Abstract
Multi-label classification problems arise in many real-world applications. Classically, in order to construct a multi-label classifier, we assume the existence of a labeled training set, where each instance is associated with a set of labels, and the task is to output a label set for each unseen instance. However, it is not always possible to have perfectly labeled data. In many problems, there is no ground truth for assigning unambiguously a label set to each instance, and several experts have to be consulted. Due to conflicts and lack of knowledge, labels might be wrongly assigned to some instances. This paper describes an evidence formalism suitable to study multi-label classification problems where the training datasets are imperfectly labelled. Several applications demonstrate the efficiency of our apporach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boutell, M.R., Luo, J., Shen, X., Brown, C.M.: Learning multi-label scene classification. Pattern Recognition 37(9), 1757–1771 (2004)
Denœux, T.: A k-nearest neighbor classification rule based on Dempster-Shafer theory. IEEE Trans. on Systems, Man and Cybernetics 25(5), 804–813 (1995)
Denœux, T., Smets, P.: Classification using Belief Functions, the Relationship between the Case-based and Model-based Approaches. IEEE Trans. on Systems, Man and Cybernetics B 36(6), 1395–1406 (2006)
Denœux, T., Younes, Z., Abdallah, F.: Representing uncertainty on set-valued variables using belief functions. Artificial Intelligence 174(7-8), 479–499 (2010)
Elisseeff, A., Weston, J.: Kernel methods for multi-labelled classification and categorical regression problems. Advances in Neural Information Processing Systems 14, 681–687 (2002)
Fürnkranz, J., Hüllermeier, E., Loza Menca, E., Brinker, K.: Multilabel classification via calibrated label ranking. Machine Learning 73(2), 133–153 (2008)
Smets, P.: The combination of evidence in the Transferable Belief Model. IEEE Trans. on Pattern Analysis and Machine Intelligence 12(5), 447–458 (1990)
Tsoumakas, G., Katakis, I.: Multi-Label Classification: An Overview. International Journal of Data Warehousing and Mining 3(3), 1–13 (2007)
Tsoumakas, G., Vlahavas, I.: Random k-Labelsets: An Ensemble Method for Multilabel Classification. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) ECML 2007. LNCS (LNAI), vol. 4701, pp. 406–417. Springer, Heidelberg (2007)
Younes, Z., Abdallah, F., Denœux, T.: An Evidence-Theoretic k-Nearest Neighbor Rule for Multi-Label Classification. In: Godo, L., Pugliese, A. (eds.) SUM 2009. LNCS (LNAI), vol. 5785, pp. 297–308. Springer, Heidelberg (2009)
Younes, Z., Abdallah, F., Denœux, T.: Multi-label classification algorithm derived from k-nearest neighbor rule with label dependencies. In: Proc. of the 16th European Signal Processing Conference, Lausanne, Switzerland, August 25-29 (2008)
Zhang, M.-L.: ML-RBF: RBF neural networks for multi-label learning. Neural Processing Letters 29(2), 61–74 (2009)
Zhang, M.-L., Zhou, Z.-H.: ML-KNN: A lazy learning approach to multi-label learning. Pattern Recognition 40(7), 2038–3048 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Younes, Z., abdallah, F., Denœux, T. (2010). Evidential Multi-Label Classification Approach to Learning from Data with Imprecise Labels. In: Hüllermeier, E., Kruse, R., Hoffmann, F. (eds) Computational Intelligence for Knowledge-Based Systems Design. IPMU 2010. Lecture Notes in Computer Science(), vol 6178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14049-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-14049-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14048-8
Online ISBN: 978-3-642-14049-5
eBook Packages: Computer ScienceComputer Science (R0)