Sciweavers

38 search results - page 4 / 8
» Kernel Regression with Order Preferences
Sort
View
CVPR
2009
IEEE
1528views Computer Vision» more  CVPR 2009»
14 years 11 months ago
Structured Output-Associative Regression
Structured outputs such as multidimensional vectors or graphs are frequently encountered in real world pattern recognition applications such as computer vision, natural language pr...
Liefeng Bo and Cristian Sminchisescu
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
14 years 7 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu
TNN
2010
176views Management» more  TNN 2010»
13 years 2 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
ILP
2003
Springer
14 years 20 days ago
Graph Kernels and Gaussian Processes for Relational Reinforcement Learning
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...
Thomas Gärtner, Kurt Driessens, Jan Ramon
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
14 years 2 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain