Sciweavers

45 search results - page 1 / 9
» Formulating distance functions via the kernel trick
Sort
View
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
14 years 5 months ago
Formulating distance functions via the kernel trick
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be for...
Gang Wu, Edward Y. Chang, Navneet Panda
MM
2005
ACM
134views Multimedia» more  MM 2005»
13 years 10 months ago
Formulating context-dependent similarity functions
Tasks of information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be formulated in a con...
Gang Wu, Edward Y. Chang, Navneet Panda
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 5 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
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 5 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
TIP
2011
162views more  TIP 2011»
12 years 11 months ago
Kernel Maximum Autocorrelation Factor and Minimum Noise Fraction Transformations
—This paper introduces kernel versions of maximum autocorrelation factor (MAF) analysis and minimum noise fraction (MNF) analysis. The kernel versions are based upon a dual formu...
Allan Aasbjerg Nielsen