Sciweavers

216 search results - page 3 / 44
» PAC Learning from Positive Statistical Queries
Sort
View
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
13 years 10 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
SODA
2001
ACM
147views Algorithms» more  SODA 2001»
13 years 7 months ago
Sublinear time approximate clustering
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
Nina Mishra, Daniel Oblinger, Leonard Pitt
BMCBI
2010
143views more  BMCBI 2010»
13 years 6 months ago
Learning gene regulatory networks from only positive and unlabeled data
Background: Recently, supervised learning methods have been exploited to reconstruct gene regulatory networks from gene expression data. The reconstruction of a network is modeled...
Luigi Cerulo, Charles Elkan, Michele Ceccarelli
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
13 years 11 months 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
STACS
1999
Springer
13 years 10 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann