Sciweavers

58 search results - page 5 / 12
» Learning a Distance Metric from Multi-instance Multi-label D...
Sort
View
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
13 years 9 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, ...
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 2 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
ICML
2003
IEEE
14 years 8 months ago
Learning Metrics via Discriminant Kernels and Multidimensional Scaling: Toward Expected Euclidean Representation
Distance-based methods in machine learning and pattern recognition have to rely on a metric distance between points in the input space. Instead of specifying a metric a priori, we...
Zhihua Zhang
PR
2010
186views more  PR 2010»
13 years 6 months ago
Feature extraction by learning Lorentzian metric tensor and its extensions
We develop a supervised dimensionality reduction method, called Lorentzian Discriminant Projection (LDP), for feature extraction and classification. Our method represents the str...
Risheng Liu, Zhouchen Lin, Zhixun Su, Kewei Tang
CVPR
2005
IEEE
14 years 9 months ago
Learning a Similarity Metric Discriminatively, with Application to Face Verification
We present a method for training a similarity metric from data. The method can be used for recognition or verification applications where the number of categories is very large an...
Sumit Chopra, Raia Hadsell, Yann LeCun