Sciweavers

1854 search results - page 228 / 371
» On Kernel Methods for Relational Learning
Sort
View
123
Voted
CVPR
2011
IEEE
14 years 10 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
Zhiding Yu, Oscar Au, Ketan Tang
151
Voted
JMLR
2002
135views more  JMLR 2002»
15 years 2 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
123
Voted
ICML
2010
IEEE
15 years 3 months ago
Projection Penalties: Dimension Reduction without Loss
Dimension reduction is popular for learning predictive models in high-dimensional spaces. It can highlight the relevant part of the feature space and avoid the curse of dimensiona...
Yi Zhang 0010, Jeff Schneider
127
Voted
CVPR
2010
IEEE
15 years 10 months ago
Sufficient Dimensionality Reduction for Visual Sequence Classification
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
Alex Shyr, Raquel Urtasun, Michael Jordan
ICIP
2007
IEEE
15 years 8 months ago
Graph Cut Segmentation with Nonlinear Shape Priors
Graph cut image segmentation with intensity information alone is prone to fail for objects with weak edges, in clutter, or under occlusion. Existing methods to incorporate shape a...
James G. Malcolm, Yogesh Rathi, Allen Tannenbaum