582 search results - page 47 / 117 » Distance Measures for Well-Distributed Sets |
KDD
2004
ACM
16 years 8 days ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
107
click to vote
EDBT
2004
ACM
16 years 4 hour ago
2004
ACM
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
112
click to vote
IJDLS
2010
14 years 9 months ago
2010
Recent initiatives like the Million Book Project and Google Print Library Project have already archived several million books in digital format, and within a few years a significa...
CVPR
2001
IEEE
16 years 1 months ago
2001
IEEE
We consider learning models for object recognition from examples. Our method is motivated by systems that use the Hausdorff distance as a shape comparison measure. Typically an ob...
188
click to vote
ICDE
1999
IEEE
16 years 1 months ago
1999
IEEE
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...