Sciweavers

403 search results - page 5 / 81
» Metric and Kernel Learning Using a Linear Transformation
Sort
View
PR
2010
156views more  PR 2010»
13 years 4 months ago
Semi-supervised clustering with metric learning: An adaptive kernel method
Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel met...
Xuesong Yin, Songcan Chen, Enliang Hu, Daoqiang Zh...
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
13 years 7 months ago
Semi-supervised sparse metric learning using alternating linearization optimization
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
Wei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, ...
PR
2007
139views more  PR 2007»
13 years 5 months ago
Learning the kernel matrix by maximizing a KFD-based class separability criterion
The advantage of a kernel method often depends critically on a proper choice of the kernel function. A promising approach is to learn the kernel from data automatically. In this p...
Dit-Yan Yeung, Hong Chang, Guang Dai
ICML
2004
IEEE
14 years 6 months ago
A fast iterative algorithm for fisher discriminant using heterogeneous kernels
We propose a fast iterative classification algorithm for Kernel Fisher Discriminant (KFD) using heterogeneous kernel models. In contrast with the standard KFD that requires the us...
Glenn Fung, Murat Dundar, Jinbo Bi, R. Bharat Rao
ICPR
2002
IEEE
14 years 6 months ago
Adaptive Kernel Metric Nearest Neighbor Classification
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions due to the curse-ofdimensionality. Sev...
Jing Peng, Douglas R. Heisterkamp, H. K. Dai