Sciweavers

683 search results - page 44 / 137
» Generalization Bounds for Learning Kernels
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
ICMCS
2005
IEEE
182views Multimedia» more  ICMCS 2005»
14 years 2 months ago
An integrated approach for generic object detection using kernel PCA and boosting
In this paper we present a novel framework for generic object class detection by integrating Kernel PCA with AdaBoost. The classifier obtained in this way is invariant to changes...
Saad Ali, Mubarak Shah
JMLR
2010
145views more  JMLR 2010»
13 years 3 months ago
Kernel Partial Least Squares is Universally Consistent
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
Gilles Blanchard, Nicole Krämer
CIKM
2008
Springer
13 years 10 months ago
Classifying networked entities with modularity kernels
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
Dell Zhang, Robert Mao
CVPR
2009
IEEE
15 years 3 months ago
Efficient Kernels for Identifying Unbounded-Order Spatial Features
Higher order spatial features, such as doublets or triplets have been used to incorporate spatial information into the bag-of-local-features model. Due to computational limits, ...
Yimeng Zhang (Carnegie Mellon University), Tsuhan ...