Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Baati, Karima; b; * | Hamdani, Tarek M.a; c | Alimi, Adel M.a | Abraham, Ajithd
Affiliations: [a] REGIM-Lab.: REsearch Groups on Intelligent Machines, University of Sfax, National Engineering School of Sfax (ENIS), Sfax, Tunisia | [b] Esprit School of Engineering, Tunis, Tunisia | [c] Taibah University, College Of Science and arts at Al-Ula, Al-Madinah al-Munawwarah, KSA | [d] Machines Intelligence Research Labs (MIR Labs), Scientific Network for Innovation and Research Excellence, Auburn, WA, USA
Correspondence: [*] Corresponding author. Karim Baati. REGIM-Lab.: REsearch Groups on Intelligent Machines, University of Sfax, National Engineering School of Sfax (ENIS), Sfax, Tunisia; Esprit School of Engineering, Tunis, Tunisia; E-mail: karim.baati@ieee.org.
Abstract: In this paper, we propose NPCc, a new Naïve Possibilistic Classifier for categorical data. The proposed classifier relies on the Bayesian structure of the Naïve Bayes Classifier for categorical data (NBCc) which stands for an interesting pattern when dealing with discrete attributes. However, unlike NBCc, the proposed NPCc is based on the possibilistic formalism as an efficient fuzzy-sets-based alternative to the probabilistic one when handling uncertain data. Distinctively, we use the possibilistic approach to estimate beliefs from categorical data and a Generalized Minimum-based classification algorithm (G-Min) as a novel algorithm to make decision from possibilistic beliefs. Experimental evaluations on 12 datasets taken from University of California Irvine (UCI) and containing all categorical data, confirm the effectiveness of the proposed new G-Min-based NPCc. With the used datasets, the proposed classifier outperforms the commonly-used classifiers for categorical data including NBCc, C4.5-based decision tree and RIPPER-based classifier. Moreover, it outperforms the two versions of NPCc using commonly-used possibilistic classification algorithms which are based on respectively, the product and the minimum operators. Consequently, we prove the efficiency of the possibilistic approach together with the G-Min algorithm for the classification of categorical data.
Keywords: Naïve possibilistic classifier, possibility theory, G-Min-based possibilistic classifier, naïve Bayesian classifier, categorical data
DOI: 10.3233/JIFS-15372
Journal: Journal of Intelligent & Fuzzy Systems, vol. 33, no. 3, pp. 1723-1731, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl