Sciweavers

340 search results - page 41 / 68
» Linear Dependent Dimensionality Reduction
Sort
View
NIPS
2004
15 years 6 months ago
Neighbourhood Components Analysis
In this paper we propose a novel method for learning a Mahalanobis distance measure to be used in the KNN classification algorithm. The algorithm directly maximizes a stochastic v...
Jacob Goldberger, Sam T. Roweis, Geoffrey E. Hinto...
ICML
2006
IEEE
15 years 11 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
ICASSP
2010
IEEE
15 years 5 months ago
A nullspace analysis of the nuclear norm heuristic for rank minimization
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
Krishnamurthy Dvijotham, Maryam Fazel
ICCV
1999
IEEE
16 years 7 months ago
Multi-View Subspace Constraints on Homographies
The motion of a planar surface between two camera views induces a homography. The homography depends on the cameraintrinsic and extrinsic parameters, as well as on the 3D plane pa...
Lihi Zelnik-Manor, Michal Irani
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 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