Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Binderberger, M.O.: Corel images database. UCI Knowledge Discovery in Databases Archive (1999), http://kdd.ics.uci.edu/
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)
Bozkaya, T., Ozsoyoglu, M.: Indexing large metric spaces for similarity search queries. ACM Transaction on Database Systems 24(3), 361–404 (1999)
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)
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)
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)
Faloutsos, C.: Searching Multimedia Databases by Content. Kluwer Academic Publishers Group, The Netherlands (1996)
Frakes, W.B., Baeza-Yates, R.: Information Retrieval - Data Structures and Algorithms. Prentice Hall, New Jersey (1992)
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)
Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, New York (1990)
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)
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)
Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38, 293–306 (1985)
Gusfield, E.: Efficient methods for multiple sequence alignments with guaranteed error bounds. Bulletin of Mathematical Biology 55, 141–154 (1993)
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)
Indyk, P.: Dimensionality reduction techniques for proximity problems. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 371–378 (2000)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (2000)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cantone, D., Ferro, A., Giugno, R., Presti, G.L., Pulvirenti, A. (2005). Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces. In: Nikoletseas, S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427186_24
Download citation
DOI: https://doi.org/10.1007/11427186_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25920-6
Online ISBN: 978-3-540-32078-4
eBook Packages: Computer ScienceComputer Science (R0)