Sciweavers

149 search results - page 22 / 30
» Semi-supervised nonlinear dimensionality reduction
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
Locally Smooth Metric Learning with Application to Image Retrieval
In this paper, we propose a novel metric learning method based on regularized moving least squares. Unlike most previous metric learning methods which learn a global Mahalanobis d...
Dit-Yan Yeung, Hong Chang
ECCV
2006
Springer
14 years 10 months ago
Extending Kernel Fisher Discriminant Analysis with the Weighted Pairwise Chernoff Criterion
Many linear discriminant analysis (LDA) and kernel Fisher discriminant analysis (KFD) methods are based on the restrictive assumption that the data are homoscedastic. In this paper...
Guang Dai, Dit-Yan Yeung, Hong Chang
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 9 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
NIPS
2003
13 years 10 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
ECCV
2004
Springer
14 years 10 months ago
Transformation-Invariant Embedding for Image Analysis
Abstract. Dimensionality reduction is an essential aspect of visual processing. Traditionally, linear dimensionality reduction techniques such as principle components analysis have...
Ali Ghodsi, Jiayuan Huang, Dale Schuurmans