136 search results - page 21 / 28 » On Learning Monotone Boolean Functions |
137
Voted
ICANN
2007
Springer
15 years 11 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
126
Voted
PAMI
2006
15 years 5 months ago
2006
Gaussian process classifiers (GPCs) are Bayesian probabilistic kernel classifiers. In GPCs, the probability of belonging to a certain class at an input location is monotonically re...
138
Voted
DAGM
2004
Springer
15 years 10 months ago
2004
Springer
We present an approach to discretizing multivariate continuous data while learning the structure of a graphical model. We derive the joint scoring function from the principle of p...
138
Voted
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
156
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. In this pap...