In this paper, we deal with two important issues regarding possibilistic network-based classifiers. The first issue addresses the reject option in possibilistic network-based classifiers. We first focus on simple threshold-based reject rules and provide interpretations for the ambiguity and distance reject then introduce a third reject kind named incompleteness reject occurring when the inputs are missing or incomplete. The second important issue we address is the one of concept drift. More specifically, we propose an efficient solution for revising a possibilistic network classifier with new information. © 2011 Springer-Verlag.
CITATION STYLE
Tabia, K. (2011). Possibilistic network-based classifiers: On the reject option and concept drift issues. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6929 LNAI, pp. 460–474). https://doi.org/10.1007/978-3-642-23963-2_36
Mendeley helps you to discover research relevant for your work.