Sciweavers

811 search results - page 48 / 163
» Minimal Kernel Classifiers
Sort
View
ICML
2008
IEEE
15 years 10 months ago
Metric embedding for kernel classification rules
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
Bharath K. Sriperumbudur, Omer A. Lang, Gert R. G....
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
15 years 10 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
IDEAL
2004
Springer
15 years 3 months ago
Kernel Density Construction Using Orthogonal Forward Regression
Abstract— The paper presents an efficient construction algorithm for obtaining sparse kernel density estimates based on a regression approach that directly optimizes model gener...
Sheng Chen, Xia Hong, Chris J. Harris
COLT
2003
Springer
15 years 3 months ago
Maximum Margin Algorithms with Boolean Kernels
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
Roni Khardon, Rocco A. Servedio
COLT
2008
Springer
14 years 11 months ago
Dimension and Margin Bounds for Reflection-invariant Kernels
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
Thorsten Doliwa, Michael Kallweit, Hans-Ulrich Sim...