Sciweavers

136 search results - page 21 / 28
» On Learning Monotone Boolean Functions
Sort
View
ICANN
2007
Springer
15 years 4 months ago
MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set
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...
Leonardo Franco, José Luis Subirats, Jos&ea...
PAMI
2006
147views more  PAMI 2006»
14 years 9 months ago
Bayesian Gaussian Process Classification with the EM-EP Algorithm
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...
Hyun-Chul Kim, Zoubin Ghahramani
DAGM
2004
Springer
15 years 3 months ago
Predictive Discretization During Model Selection
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...
Harald Steck, Tommi Jaakkola
ICML
2004
IEEE
15 years 10 months ago
Sequential skewing: an improved skewing algorithm
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...
Soumya Ray, David Page
ECML
2006
Springer
15 years 1 months ago
EM Algorithm for Symmetric Causal Independence Models
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...
Rasa Jurgelenaite, Tom Heskes