Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems.
Monique LaurentPublished in: SIAM J. Matrix Anal. Appl. (2001)
Keyphrases
- euclidean distance
- matrix completion
- positive semidefinite
- semidefinite programming
- low rank
- distance measure
- kernel matrix
- distance metric
- distance function
- data sets
- similarity measure
- semidefinite
- feature selection
- linear combination
- dimensionality reduction
- metric learning
- collaborative filtering
- small number
- convex relaxation
- feature vectors