Sciweavers

1419 search results - page 72 / 284
» Approximation Methods for Supervised Learning
Sort
View
CORR
2002
Springer
86views Education» more  CORR 2002»
13 years 9 months ago
The Management of Context-Sensitive Features: A Review of Strategies
In this paper, we review five heuristic strategies for handling context-sensitive features in supervised machine learning from examples. We discuss two methods for recovering lost...
Peter D. Turney
CVPR
2007
IEEE
15 years 1 days ago
Detector adaptation by maximising agreement between independent data sources
Traditional methods for creating classifiers have two main disadvantages. Firstly, it is time consuming to acquire, or manually annotate, the training collection. Secondly, the da...
Alan F. Smeaton, Ciarán O. Conaire, Noel E....
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 10 months ago
Model compression
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
Cristian Bucila, Rich Caruana, Alexandru Niculescu...
MICAI
2004
Springer
14 years 3 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 10 months ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach