Sciweavers

3256 search results - page 111 / 652
» Learning Linear Transformations
Sort
View
JMLR
2002
135views more  JMLR 2002»
13 years 8 months ago
Covering Number Bounds of Certain Regularized Linear Function Classes
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
Tong Zhang
CVPR
2012
IEEE
11 years 11 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
ICML
2006
IEEE
14 years 9 months ago
MISSL: multiple-instance semi-supervised learning
There has been much work on applying multiple-instance (MI) learning to contentbased image retrieval (CBIR) where the goal is to rank all images in a known repository using a smal...
Rouhollah Rahmani, Sally A. Goldman
ICALT
2005
IEEE
14 years 2 months ago
MALESAbrain for Problem-Based Learning in IT Education
This paper reports MALESAbrain an intelligent online tool for problem-based learning (PBL) in IT education. The learning model of MALESAbrain is built on the notions of threshold ...
Akcell Chiang, Mohd Sapiyan Baba
ICANN
2003
Springer
14 years 2 months ago
Sparse Coding with Invariance Constraints
We suggest a new approach to optimize the learning of sparse features under the constraints of explicit transformation symmetries imposed on the set of feature vectors. Given a set...
Heiko Wersing, Julian Eggert, Edgar Körner