Sciweavers

199 search results - page 18 / 40
» Accuracy of distance metric learning algorithms
Sort
View
149
Voted
DAGM
2011
Springer
14 years 8 days ago
Relaxed Exponential Kernels for Unsupervised Learning
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
Karim T. Abou-Moustafa, Mohak Shah, Fernando De la...
INFOCOM
1999
IEEE
15 years 4 months ago
An Architecture for a Global Internet Host Distance Estimation Service
There is an increasing need for Internet hosts to be able to quickly and efficiently learn the distance, in terms of metrics such as latency or bandwidth, between Internet hosts. ...
Paul Francis, Sugih Jamin, Vern Paxson, Lixia Zhan...
96
Voted
JMLR
2006
123views more  JMLR 2006»
15 years 13 days ago
Adaptive Prototype Learning Algorithms: Theoretical and Experimental Studies
In this paper, we propose a number of adaptive prototype learning (APL) algorithms. They employ the same algorithmic scheme to determine the number and location of prototypes, but...
Fu Chang, Chin-Chin Lin, Chi-Jen Lu
109
Voted
PR
2006
141views more  PR 2006»
15 years 12 days ago
Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
The performance of many supervised and unsupervised learning algorithms is very sensitive to the choice of an appropriate distance metric. Previous work in metric learning and ada...
Hong Chang, Dit-Yan Yeung, William K. Cheung
113
Voted
CIKM
2009
Springer
15 years 7 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...