Sciweavers

136 search results - page 16 / 28
» On Learning Monotone Boolean Functions
Sort
View
ICML
2001
IEEE
14 years 8 months ago
Learning with the Set Covering Machine
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
Mario Marchand, John Shawe-Taylor
SIAMCOMP
2011
13 years 2 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
14 years 4 days ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
13 years 9 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu
VDA
2010
206views Visualization» more  VDA 2010»
13 years 10 months ago
Visual discovery in multivariate binary data
This paper presents the concept of Monotone Boolean Function Visual Analytics (MBFVA) and its application to the medical domain. The medical application is concerned with discover...
Boris Kovalerchuk, Florian Delizy, Logan Riggs, Ev...