576 search results - page 5 / 116 » Structured metric learning for high dimensional problems |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Distance metric learning and nonlinear dimensionality reduction are two interesting and active topics in recent years. However, the connection between them is not thoroughly studi...
SIROCCO
2004
13 years 9 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
JMLR
2010
13 years 2 months ago
2010
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...
FSKD
2006
Springer
13 years 11 months ago
2006
Springer
Nearest neighbor classifier is a widely-used effective method for multi-class problems. However, it suffers from the problem of the curse of dimensionality in high dimensional spac...