1548 search results - page 106 / 310 » Supervised Tensor Learning |
127
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
126
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
128
click to vote
ICML
1997
IEEE
15 years 6 months ago
1997
IEEE
Feature selection has proven to be a valuable technique in supervised learning for improving predictive accuracy while reducing the number of attributes considered in a task. We i...
113
click to vote
DIS
2009
Springer
15 years 9 months ago
2009
Springer
Multiple-instance learning (MIL) is a generalization of the supervised learning problem where each training observation is a labeled bag of unlabeled instances. Several supervised ...
127
click to vote
IROS
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— This paper presents a learning system that uses Qlearning with a resource allocating network (RAN) for behavior learning in mobile robotics. The RAN is used as a functi...