Abstract
Searching for a median of a set of patterns is a well-known technique to model the set or to aid searching for more accurate models such as a generalized median or a k-median. While medians and generalized medians are (relatively) easy to compute in the case of Euclidean representation spaces, this is no longer true when more complex distance measures are to be used. In these cases, a direct method to perform median search is not feasible for large sets of patterns. To cope with this computational problem, we proposed a technique which is significantly faster than the direct approach, both in terms of distance computations and overhead (time not alloted to distance computing). We also proposed another technique which is even faster than its predecessor in terms of distance computations, though it involves significantly more overhead. In this paper we introduce a generalized algorithm for fast median search which includes these two techniques as particular cases. We also develop a new particular case of this generalized algorithm.
Chapter PDF
References
E Casacuberta and M. D. de Antonio. A greedy algorithm for computing approximate Median Strings. In A. Sanfeliu, J. J. Villanueva, and J. Vitriá, editors, VII National Symposium on Pattern Recognition and Image Analysis, volume 1, pages 193–198, Bellaterra, Barcelona (Spain), 1997.
A. Juan and E. Vidal. An optimized K-means-like algorithm. In 4th Portuguese Conference on Pattern Recognition, pages 11–16, Coimbra, Portugal, 1992.
A. Juan and E. Vidal. Fast k-Means-like Clustering in Metric Spaces. Pattern Recognition Letters, 15(1):19–25, 1994.
A. Juan and E. Vidal. An Algorithm For Fast Median Search. In A. Sanfeliu, J. J. Villanueva, and J. Vitriá, editors, VII National Symposium on Pattern Recognition and Image Analysis, volume 1, pages 187–192, Bellaterra, Barcelona (Spain), 1997.
T. Kohonen. Median Strings. Pattern Recognition Letters, 3:309–313, 1985.
P. B. Mirchandani and R. L. Francis, editors. Discrete Location Theory. Wiley, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Juan, A., Vidal, E. (1998). Fast median search in metric spaces. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds) Advances in Pattern Recognition. SSPR /SPR 1998. Lecture Notes in Computer Science, vol 1451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033318
Download citation
DOI: https://doi.org/10.1007/BFb0033318
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64858-1
Online ISBN: 978-3-540-68526-5
eBook Packages: Springer Book Archive