Sciweavers

4 search results - page 1 / 1
» Pruning belief decision tree methods in averaging and conjun...
Sort
View
IJAR
2007
87views more  IJAR 2007»
13 years 4 months ago
Pruning belief decision tree methods in averaging and conjunctive approaches
The belief decision tree (BDT) approach is a decision tree in an uncertain environment where the uncertainty is represented through the Transferable Belief Model (TBM), one interp...
Salsabil Trabelsi, Zied Elouedi, Khaled Mellouli
DAC
2005
ACM
14 years 5 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 4 months ago
Extraction of Symbolic Rules from Artificial Neural Networks
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...
S. M. Kamruzzaman, Md. Monirul Islam
FSKD
2006
Springer
124views Fuzzy Logic» more  FSKD 2006»
13 years 8 months ago
An Effective Combination of Multiple Classifiers for Toxicity Prediction
This paper presents an investigation into the combination of different classifiers for toxicity prediction. These classification methods involved in generating classifiers for comb...
Gongde Guo, Daniel Neagu, Xuming Huang, Yaxin Bi