Sciweavers

69 search results - page 2 / 14
» Learning with Distance Substitution Kernels
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
A kernelized maximal-figure-of-merit learning approach based on subspace distance minimization
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...
Byungki Byun, Chin-Hui Lee
ICML
2008
IEEE
14 years 6 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
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 6 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
ICML
2008
IEEE
14 years 6 months ago
A reproducing kernel Hilbert space framework for pairwise time series distances
A good distance measure for time series needs to properly incorporate the temporal structure, and should be applicable to sequences with unequal lengths. In this paper, we propose...
Zhengdong Lu, Todd K. Leen, Yonghong Huang, Deniz ...
ICMLC
2005
Springer
13 years 11 months ago
Kernel-Based Metric Adaptation with Pairwise Constraints
Abstract. Many supervised and unsupervised learning algorithms depend on the choice of an appropriate distance metric. While metric learning for supervised learning tasks has a lon...
Hong Chang, Dit-Yan Yeung