Sciweavers

1106 search results - page 79 / 222
» On regularization algorithms in learning theory
Sort
View
182
Voted
IJON
2010
178views more  IJON 2010»
15 years 3 months ago
An empirical study of two typical locality preserving linear discriminant analysis methods
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Lishan Qiao, Limei Zhang, Songcan Chen
ICAART
2010
INSTICC
16 years 2 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
ECAI
2004
Springer
15 years 8 months ago
Bias Windowing for Relational Learning
A central issue in relational learning is the choice of an appropriate bias for limiting first-order induction. The purpose of this study is to circumvent this issue within a unifo...
Frédéric Koriche
CVPR
2007
IEEE
16 years 7 months ago
Concurrent Multiple Instance Learning for Image Categorization
We propose a new multiple instance learning (MIL) algorithm to learn image categories. Unlike existing MIL algorithms, in which the individual instances in a bag are assumed to be...
Guo-Jun Qi, Xian-Sheng Hua, Yong Rui, Tao Mei, Jin...
AAAI
2007
15 years 7 months ago
Kernel Regression with Order Preferences
We propose a novel kernel regression algorithm which takes into account order preferences on unlabeled data. Such preferences have the form that point x1 has a larger target value...
Xiaojin Zhu, Andrew B. Goldberg