Sciweavers

683 search results - page 55 / 137
» Generalization Bounds for Learning Kernels
Sort
View
AAAI
2007
14 years 7 days ago
Refutation by Randomised General Resolution
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
Steven David Prestwich, Inês Lynce
MM
2005
ACM
134views Multimedia» more  MM 2005»
14 years 3 months ago
Formulating context-dependent similarity functions
Tasks of information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be formulated in a con...
Gang Wu, Edward Y. Chang, Navneet Panda
ICML
2004
IEEE
14 years 10 months ago
Online and batch learning of pseudo-metrics
We describe and analyze an online algorithm for supervised learning of pseudo-metrics. The algorithm receives pairs of instances and predicts their similarity according to a pseud...
Shai Shalev-Shwartz, Yoram Singer, Andrew Y. Ng
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 10 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
14 years 1 months ago
Bounding XCS's parameters for unbalanced datasets
This paper analyzes the behavior of the XCS classifier system on imbalanced datasets. We show that XCS with standard parameter settings is quite robust to considerable class imbal...
Albert Orriols-Puig, Ester Bernadó-Mansilla