Sciweavers

1302 search results - page 153 / 261
» Fair Equivalence Relations
Sort
View
LICS
2010
IEEE
15 years 4 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky
RSKT
2010
Springer
15 years 4 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou
IFIPTCS
2010
15 years 3 months ago
Traceable Sets
Abstract. We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncom...
Rupert Hölzl, Wolfgang Merkle
LPAR
2010
Springer
15 years 3 months ago
Hardness of Preorder Checking for Basic Formalisms
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...
Laura Bozzelli, Axel Legay, Sophie Pinchinat
DMIN
2009
223views Data Mining» more  DMIN 2009»
15 years 3 months ago
Are Decision Trees Always Greener on the Open (Source) Side of the Fence?
- This short paper compares the performance of three popular decision tree algorithms: C4.5, C5.0, and WEKA's J48. These decision tree algorithms are all related in that C5.0 ...
Samuel Moore, Daniel D'Addario, James Kurinskas, G...