Sciweavers

1419 search results - page 55 / 284
» Approximation Methods for Supervised Learning
Sort
View
CVPR
2012
IEEE
12 years 12 days ago
Supervised hashing with kernels
Recent years have witnessed the growing popularity of hashing in large-scale vision problems. It has been shown that the hashing quality could be boosted by leveraging supervised ...
Wei Liu, Jun Wang, Rongrong Ji, Yu-Gang Jiang, Shi...
ESANN
2006
13 years 11 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
DATAMINE
2006
139views more  DATAMINE 2006»
13 years 10 months ago
Discovering Classification from Data of Multiple Sources
In many large e-commerce organizations, multiple data sources are often used to describe the same customers, thus it is important to consolidate data of multiple sources for intell...
Charles X. Ling, Qiang Yang
ICCBR
2007
Springer
14 years 4 months ago
Usages of Generalization in Case-Based Reasoning
The aim of this paper is to analyze how the generalizations built by a CBR method can be used as local approximations of a concept. From this point of view, these local approximati...
Eva Armengol
ATAL
2009
Springer
14 years 4 months ago
Generalized model learning for reinforcement learning in factored domains
Improving the sample efficiency of reinforcement learning algorithms to scale up to larger and more realistic domains is a current research challenge in machine learning. Model-ba...
Todd Hester, Peter Stone