Sciweavers

8 search results - page 2 / 2
» Learning DNF by Approximating Inclusion-Exclusion Formulae
Sort
View
IJCAI
2007
13 years 9 months ago
Learning from Partial Observations
We present a general machine learning framework for modelling the phenomenon of missing information in data. We propose a masking process model to capture the stochastic nature of...
Loizos Michael
COLT
2007
Springer
14 years 1 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 26 days ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm