Sciweavers

199 search results - page 9 / 40
» Accuracy of distance metric learning algorithms
Sort
View
ICML
2003
IEEE
14 years 9 months ago
An Analysis of Rule Evaluation Metrics
In this paper we analyze the most popular evaluation metrics for separate-and-conquer rule learning algorithms. Our results show that all commonly used heuristics, including accur...
Johannes Fürnkranz, Peter A. Flach
CVPR
2009
IEEE
13 years 6 months ago
Learning IMED via shift-invariant transformation
The IMage Euclidean Distance (IMED) is a class of image metrics, in which the spatial relationship between pixels is taken into consideration. It was shown that calculating the IM...
Bing Sun, Jufu Feng, Liwei Wang
ICML
2007
IEEE
14 years 9 months ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
SDM
2009
SIAM
154views Data Mining» more  SDM 2009»
14 years 5 months ago
AMORI: A Metric-Based One Rule Inducer.
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...
Niklas Lavesson, Paul Davidsson
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer