Sciweavers

32 search results - page 5 / 7
» Transductive Rademacher Complexities for Learning Over a Gra...
Sort
View
CIKM
2009
Springer
15 years 4 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan
KI
2010
Springer
14 years 4 months ago
Lifelong Map Learning for Graph-based SLAM in Static Environments
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
Henrik Kretzschmar, Giorgio Grisetti, Cyrill Stach...
CVPR
2008
IEEE
15 years 11 months ago
Max Margin AND/OR Graph learning for parsing the human body
We present a novel structure learning method, Max Margin AND/OR Graph (MM-AOG), for parsing the human body into parts and recovering their poses. Our method represents the human b...
Long Zhu, Yuanhao Chen, Yifei Lu, Chenxi Lin, Alan...
ICML
2007
IEEE
15 years 10 months ago
Gradient boosting for kernelized output spaces
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 3 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...