返回
Naive possibilistic network classifiers
DOI:10.1016/j.fss.2009.01.009.png)
摘要
En 中文
Naive Bayesian network classifiers have proved their effectiveness to accomplish the classification task, even if they work under the strong assumption of independence of attributes in the context of the class node. However, as all of them are based on probability theory, they run into problems when they are faced with imperfection. This paper proposes a new approach of classification under the possibilistic framework with naive classifiers. To output the naive possibilistic network classifier, two procedures are studied namely the building phase, which deals with imperfect (imprecise/uncertain) dataset attributes and classes, and the classification phase, which is used to classify new instances that may be characterized by imperfect attributes. To improve the performance of our classifier, we propose two extensions namely selective naive possibilistic classifier and semi-naive possibilistic classifier. Experimental study has shown naive Bayes style possibilistic classifier, and is efficient in the imperfect case. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Possibility theory
Classification
Naive Bayes classifier
Possibilistic classifier
Aggregation operators
期刊
IF:
2.7
论文数:
7.6K
被引数:
1.5W
机构
引用论文
Ruthenium oxide-based nanocomposites with high specific surface area and improved capacitance as a supercapacitor具有高比表面积和改善的电容的氧化钌基纳米复合材料作为超级电容器
RSC Adv.
IF0

