Tree Augmented Naïve possibilistic network classifier

Tree Augmented Naïve Bayes Network (TAN) classifier has shown excellent performance in Machine Learning and Data Mining in spite of the assumption of one- dependence of attributes. This paper proposes a new approach of classification under the possibilistic network (PN) framework with TAN, named tree augmented naïve possibilistic network classifier (TANPC), which combines the advantages of the PN and TAN. The classifier is built from a training set where instances can be expressed by imperfect attributes and classes. It is able to classify new instances those may have imperfect attributes.

[1]  Liangxiao Jiang,et al.  A Novel Bayes Model: Hidden Naive Bayes , 2009, IEEE Transactions on Knowledge and Data Engineering.

[2]  Nir Friedman,et al.  Bayesian Network Classifiers , 1997, Machine Learning.

[3]  Christian Borgelt,et al.  Data Mining with Graphical Models , 2002, ALT.

[4]  Khaled Mellouli,et al.  Naïve possibilistic network classifiers , 2009, Fuzzy Sets Syst..

[5]  Khaled Mellouli,et al.  Anytime propagation algorithm for min-based possibilistic graphs , 2003, Soft Comput..

[6]  Liangxiao Jiang,et al.  Hidden Naive Bayes , 2005, AAAI.

[7]  C. Borgelt,et al.  A Naive Bayes Style Possibilistic Classifier , 2004 .