582 search results - page 19 / 117 » Distance Measures for Well-Distributed Sets |
WWW
2010
ACM
14 years 3 months ago
2010
ACM
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
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...
CCA
2009
Springer
14 years 1 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
KDD
2000
ACM
14 years 5 days ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
IMC
2004
ACM
14 years 2 months ago
2004
ACM
In this paper, we propose a model for representing and predicting distances in large-scale networks by matrix factorization. The model is useful for network distance sensitive app...