Abstract
Possibilistic networks are graphical models particularly suitable for representing and reasoning with uncertain and incomplete information. According to the underlying interpretation of possibilistic scales, possibilistic networks are either quantitative or qualitative. In this paper, we address possibilistic-based classification with uncertain inputs. More precisely, we first analyze Jeffrey’s rule for revising possibility distributions by uncertain observations. Then, we propose an efficient algorithm for revising possibility distributions encoded by a naive possibilistic network. This algorithm is particularly suitable for classification with uncertain inputs since it allows classification in polynomial time using different efficient transformations of initial naive possibilistic networks.
This is a preview of subscription content, log in via an institution to check access.
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
Haouari, Z.E.B., Amor, N.B., Mellouli, K.: Naive possibilistic network classifier. In: Proceedings of The Thirteenth Congress of International Association for Fuzzy-Set Management and Economy, SIGEF 2006 (2006)
Benferhat, S., Dubois, D., Garcia, L., Prade, H.: Possibilistic logic bases and possibilistic graphs. In: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence UAI 1999, Stockholm, pp. 57–64 (1999)
Borgelt, C., Gebhardt, J.: A naive bayes style possibilistic classifier. In: Proceedings of the 7th European Congress on Intelligent Techniques and Soft Computing EUFIT 1999, Aachen, Germany (1999)
Borgelt, C., Kruse, R.: Graphical Models: Methods for Data Analysis and Mining. John Wiley & Sons, Inc., New York (2002)
Borgelt, C., Kruse, R.: Learning from imprecise data: possibilistic graphical models. Computational Statistics & Data Analysis 38(4), 449–463 (2002)
Kruse, R., Borgelt, C., Gebhardt, J.: Possibilistic graphical models. In: Proceedings of International School for the Synthesis of Expert Knowledge (ISSEK 1998), Udine, Italy, pp. 51–68 (1998)
Dubois, D., Prade, H.: A synthetic view of belief revision with uncertain inputs in the framework of possibility theory. Int. J. of Approximate Reasoning 17(2–3), 295–324 (1997)
Jeffrey, R.C.: The Logic of Decision. McGraw Hill, New York (1965)
Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann Publishers Inc., San Francisco (1988)
Spohn, W.: Ordinal conditional functions: A dynamic theory of epistemic states. In: Harper, W.L., Skyrms, B. (eds.) Causation in decision, belief change, and statistics, vol. II, pp. 105–134. Kluwer Academic Publishers, Dordrecht (1988)
Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems 1(3) (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benferhat, S., Tabia, K. (2008). An Efficient Algorithm for Naive Possibilistic Classifiers with Uncertain Inputs. In: Greco, S., Lukasiewicz, T. (eds) Scalable Uncertainty Management. SUM 2008. Lecture Notes in Computer Science(), vol 5291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87993-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-87993-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87992-3
Online ISBN: 978-3-540-87993-0
eBook Packages: Computer ScienceComputer Science (R0)