148 search results - page 21 / 30 » Context-Based Distance Learning for Categorical Data Cluster... |
117
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
118
click to vote
SODA
1998
ACM
15 years 3 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
153
Voted
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper presents a simple, yet effective method of building a codebook for pairs of spatially close SIFT descriptors. Integrating such codebook into the popular bag-o...
119
click to vote
SDM
2004
SIAM
15 years 3 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
135
Voted
PR
2006
15 years 1 months ago
2006
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...