Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces

  • Domenico Cantone
  • Alfredo Ferro
  • Rosalba Giugno
  • Giuseppe Lo Presti
  • Alfredo Pulvirenti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3503)


Extensions of the randomized tournaments techniques introduced in [6,7] to approximate solutions of 1-median and diameter computation of finite subsets of general metric spaces are proposed. In the linear algorithms proposed in [6] (resp.[7]) randomized tournaments are played among the elements of an input subset S of a metric space. At each turn the residual set of winners is randomly partitioned in nonempty disjoint subsets of fixed size. The 1-median (resp. diameter) of each subset goes to the next turn whereas the residual elements are discarded. The algorithm proceeds recursively until a residual set of cardinality less than a given threshold is generated. The 1-median (resp. diameter) of such residual set is the approximate 1-median (resp. diameter) of the input set S. The \({\mathcal O}\)(n log n) extensions proposed in this paper replace local single-winner tournaments by multiple-winners ones. Moreover consensus is introduced as multiple runs of the same tournament. Experiments on both synthetic and real data show that these new proposed versions give significantly better approximations of the exact solutions of the corresponding optimization problems.


Average Percentage Error Residual Element Diameter Computation Nonempty Disjoint Subset Relative Frequency Histogram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Auletta, V., Parente, D., Persiano, G.: Dynamic and static algorithms for optimal placement of resources in a tree. Theoretical Computer Science 165, 441–461 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Binderberger, M.O.: Corel images database. UCI Knowledge Discovery in Databases Archive (1999),
  3. 3.
    Borodin, A., Ostrovsky, R., Rabani, Y.: Subquadratic approximation algorithms for clustering problems in high dimensional spaces. In: Ann. ACM Symp. Theory of Computing, pp. 435–444 (1999)Google Scholar
  4. 4.
    Bozkaya, T., Ozsoyoglu, M.: Indexing large metric spaces for similarity search queries. ACM Transaction on Database Systems 24(3), 361–404 (1999)CrossRefGoogle Scholar
  5. 5.
    Burkard, R.E., Krarup, J.: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60(3), 193–216 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Cantone, D., Cincotti, G., Ferro, A., Pulvirenti, A.: An efficient approximate algorithm for the 1-median problem in metric spaces. SIAM Journal on Optimization (2005) (to appear)Google Scholar
  7. 7.
    Cantone, D., Ferro, A., Pulvirenti, A., Reforgiato, D., Shasha, D.: Antipole tree indexing to support range search and k-nearest neighbor search in metric spaces. IEEE Transaction on knowledge and Data Engineering 17(4) (2005)Google Scholar
  8. 8.
    Faloutsos, C.: Searching Multimedia Databases by Content. Kluwer Academic Publishers Group, The Netherlands (1996)zbMATHGoogle Scholar
  9. 9.
    Frakes, W.B., Baeza-Yates, R.: Information Retrieval - Data Structures and Algorithms. Prentice Hall, New Jersey (1992)Google Scholar
  10. 10.
    Frederickson, G.N.: Parametric search and locating supply centers in trees. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 299–319. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  11. 11.
    Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, New York (1990)zbMATHGoogle Scholar
  12. 12.
    Ganti, V., Ramakrishnan, R., Gehrke, J., Powell, A., French, J.: Clustering large datasets in arbitrary metric spaces. In: Proceedings of the IEEE 15th International Conference on Data Engineering, pp. 502–511 (1999)Google Scholar
  13. 13.
    Goel, A., Indyk, P., Varadarajan, K.: Reductions among high dimensional proximity problems. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 769–778 (2001)Google Scholar
  14. 14.
    Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38, 293–306 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Gusfield, E.: Efficient methods for multiple sequence alignments with guaranteed error bounds. Bulletin of Mathematical Biology 55, 141–154 (1993)zbMATHGoogle Scholar
  16. 16.
    Indyk, P.: Sublinear time algorithms for metric space problems. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 428–434 (1999)Google Scholar
  17. 17.
    Indyk, P.: Dimensionality reduction techniques for proximity problems. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 371–378 (2000)Google Scholar
  18. 18.
    Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (2000)Google Scholar
  19. 19.
    Swift, S., Tucker, A., Vinciotti, V., Martin, N., Orengo, C., Liu, X., Kellam, P.: Consensus clustering and functional interpretation of gene-expression data. Genome Biology 5(11) (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Domenico Cantone
    • 1
  • Alfredo Ferro
    • 1
  • Rosalba Giugno
    • 1
  • Giuseppe Lo Presti
    • 1
  • Alfredo Pulvirenti
    • 1
  1. 1.Dipartimento di Matematica e InformaticaUniversity of CataniaCataniaItaly

Personalised recommendations