Papers
172,654 papers found
On Boosting with Polynomially Bounded Distributions
Nader H. Bshouty, Dmitry Gavinsky
On Online Learning of Decision Lists
Ziv Nevo, Ran El-Yaniv
On the Convergence of Optimistic Policy Iteration
John N. Tsitsiklis
On Using Extended Statistical Queries to Avoid Membership Queries
Nader H. Bshouty, Vitaly Feldman
Optimal Structure Identification With Greedy Search
David Maxwell Chickering
Policy Search using Paired Comparisons
Malcolm J. A. Strens, Andrew W. Moore
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Peter L. Bartlett, Shahar Mendelson
Recommender Systems Using Linear Classifiers
Tong Zhang, Vijay S. Iyengar
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
Ronen I. Brafman, Moshe Tennenholtz
Round Robin Classification
Johannes Fürnkranz
Shallow Parsing using Specialized HMMs
Antonio Molina, Ferran Pla
Shallow Parsing with PoS Taggers and Linguistic Features
Beáta Megyesi
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
Prasanth B. Nair, Arindam Choudhury, Andy J. Keane
Stability and Generalization
Olivier Bousquet, André Elisseeff
Stopping Criterion for Boosting-Based Data Reduction Techniques: from Binary to Multiclass Problem
Marc Sebban, Richard Nock, Stéphane Lallich
Text Chunking based on a Generalization of Winnow
Tong Zhang, Fred Damerau, David Johnson
Text Classification using String Kernels
Huma Lodhi, Craig Saunders, John Shawe-Taylor et al.
The Learning-Curve Sampling Method Applied to Model-Based Clustering
Christopher Meek, Bo Thiesson, David Heckerman
The Representational Power of Discrete Bayesian Networks
Charles X. Ling, Huajie Zhang
The Set Covering Machine
Mario Marchand, John Shawe-Taylor
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
Masashi Sugiyama, Klaus-Robert Müller
Tracking a Small Set of Experts by Mixing Past Posteriors
Olivier Bousquet, Manfred K. Warmuth