Sciweavers

3256 search results - page 451 / 652
» Learning Linear Transformations
Sort
View
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 10 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
SEAL
1998
Springer
15 years 10 months ago
Genetic Programming with Active Data Selection
Genetic programming evolves Lisp-like programs rather than fixed size linear strings. This representational power combined with generality makes genetic programming an interesting ...
Byoung-Tak Zhang, Dong-Yeon Cho
COLT
2007
Springer
15 years 10 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
COLT
2006
Springer
15 years 10 months ago
DNF Are Teachable in the Average Case
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
Homin K. Lee, Rocco A. Servedio, Andrew Wan
AUSAI
2008
Springer
15 years 8 months ago
Additive Regression Applied to a Large-Scale Collaborative Filtering Problem
Abstract. The much-publicized Netflix competition has put the spotlight on the application domain of collaborative filtering and has sparked interest in machine learning algorithms...
Eibe Frank, Mark Hall