Sciweavers

1227 search results - page 8 / 246
» Approximate Kernel Clustering
Sort
View
74
Voted
NIPS
2007
14 years 11 months ago
Random Features for Large-Scale Kernel Machines
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...
Ali Rahimi, Benjamin Recht
ICPR
2008
IEEE
15 years 11 months ago
Time-series clustering by approximate prototypes
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
Pasi Fränti, Pekka Nykänen, Ville Hautam...
NIPS
2001
14 years 11 months ago
Sampling Techniques for Kernel Methods
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels: sampling and quantization of the Gram matrix in training, randomized rounding...
Dimitris Achlioptas, Frank McSherry, Bernhard Sch&...
ICML
2007
IEEE
15 years 10 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
71
Voted
IJCV
2007
208views more  IJCV 2007»
14 years 9 months ago
Binet-Cauchy Kernels on Dynamical Systems and its Application to the Analysis of Dynamic Scenes
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
S. V. N. Vishwanathan, Alexander J. Smola, Ren&eac...