Fast median search in metric spaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1451, Issue , 1998, Pages 905-912

  Juan, A ^a   Vidal, E ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Distance; Fast search; Metric spaces; Set median

Indexed keywords

SET THEORY; TOPOLOGY;

COMPUTATIONAL PROBLEM; DISTANCE; DISTANCE COMPUTATION; FAST SEARCH; GENERALIZED ALGORITHMS; METRIC SPACES; REPRESENTATION SPACE; SET MEDIAN;

PATTERN RECOGNITION;

EID: 84947803847     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0033318     Document Type: Conference Paper

References (6)

1. 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, Beltaterra, Barcelona (Spain), 1997.
2. A. Juan and E. Vidal. An optimized K-means-like algorithm. In 4th Portuguese Conference on Pattern Recognition, pages 11-16, Coimbra, Portugal, 1992.
3. A. Juan and E. Vidal. Fast k-Means-like Clustering in Metric Spaces. Pattern Recognition Letters, 15(1): 19-25, 1994.
4. 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.
5. T. Kohonen. Median Strings. Pattern Recognition Letters, 3:309-313, 1985.
6. R B. Mirchandani and R. L. Francis, editors. Discrete Location Theory. Wiley, 1990.