Sciweavers

109 search results - page 9 / 22
» Classifier Combining Rules Under Independence Assumptions
Sort
View
RR
2009
Springer
14 years 1 months ago
A Reasoner for Simple Conceptual Logic Programs
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
Stijn Heymans, Cristina Feier, Thomas Eiter
JMLR
2012
11 years 9 months ago
Bayesian regularization of non-homogeneous dynamic Bayesian networks by globally coupling interaction parameters
To relax the homogeneity assumption of classical dynamic Bayesian networks (DBNs), various recent studies have combined DBNs with multiple changepoint processes. The underlying as...
Marco Grzegorczyk, Dirk Husmeier
PR
2006
83views more  PR 2006»
13 years 6 months ago
Optimal convex error estimators for classification
A cross-validation error estimator is obtained by repeatedly leaving out some data points, deriving classifiers on the remaining points, computing errors for these classifiers on ...
Chao Sima, Edward R. Dougherty
GPEM
2000
80views more  GPEM 2000»
13 years 6 months ago
Explanatory Analysis of the Metabolome Using Genetic Programming of Simple, Interpretable Rules
Genetic programming, in conjunction with advanced analytical instruments, is a novel tool for the investigation of complex biological systems at the whole-tissue level. In this stu...
Helen E. Johnson, Richard J. Gilbert, Michael K. W...
KDD
1998
ACM
442views Data Mining» more  KDD 1998»
13 years 11 months ago
BAYDA: Software for Bayesian Classification and Feature Selection
BAYDA is a software package for flexible data analysis in predictive data mining tasks. The mathematical model underlying the program is based on a simple Bayesian network, the Na...
Petri Kontkanen, Petri Myllymäki, Tomi Siland...