Sciweavers

93 search results - page 6 / 19
» Intrinsic Complexity of Uniform Learning
Sort
View
BIBE
2007
IEEE
148views Bioinformatics» more  BIBE 2007»
14 years 4 months ago
A New Smoothing Model for Analyzing Array CGH Data
—Array based Comparative Genomic Hybridization (CGH) is a molecular cytogenetic method for the detection of chromosomal imbalances and it has been extensively used for studying c...
Nha Nguyen, Heng Huang, Soontorn Oraintara, An P. ...
PAAMS
2010
Springer
13 years 7 months ago
Variable Length-Based Genetic Representation to Automatically Evolve Wrappers
The Web has been the star service on the Internet, however the outsized information available and its decentralized nature has originated an intrinsic difficulty to locate, extract...
David F. Barrero, Antonio González-Pardo, M...
ICML
2008
IEEE
14 years 10 months ago
On multi-view active learning and the combination with semi-supervised learning
Multi-view learning has become a hot topic during the past few years. In this paper, we first characterize the sample complexity of multi-view active learning. Under the expansion...
Wei Wang, Zhi-Hua Zhou
COLT
2005
Springer
14 years 3 months ago
Analysis of Perceptron-Based Active Learning
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
Sanjoy Dasgupta, Adam Tauman Kalai, Claire Montele...
NIPS
2008
13 years 11 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari