Abstract
Helly’s theorem is a fundamental result in discrete geometry, describing the ways in which convex sets intersect with each other. If S is a set of n points in ℝd, we say that S is (k,G)-clusterable if it can be partitioned into k clusters (subsets) such that each cluster can be contained in a translated copy of a geometric object G. In this paper, as an application of Helly’s theorem, by taking a constant size sample from S, we present a testing algorithm for (k,G)-clustering, i.e., to distinguish between two cases: when S is (k,G)-clusterable, and when it is ε-far from being (k,G)-clusterable. A set S is ε-far (0 < ε ≤ 1) from being (k,G)-clusterable if at least εn points need to be removed from S to make it (k,G)-clusterable. We solve this problem for k = 1 and when G is a symmetric convex object. For k > 1, we solve a weaker version of this problem. Finally, as an application of our testing result, in clustering with outliers, we show that one can find the approximate clusters by querying a constant size sample, with high probability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of clustering. SIAM J. Discrete Math. 16(3), 393–417 (2003)
Anderberg, M.R.: Cluster Analysis for Applications. Academic Press (1973)
Chakraborty, S., Pratap, R., Roy, S., Saraf, S.: Helly-type theorems in property testing. CoRR, abs/1307.8268 (2013)
Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers, pp. 642–651 (2001)
Czumaj, A., Sohler, C.: Property testing with geometric queries. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 266–277. Springer, Heidelberg (2001)
Czumaj, A., Sohler, C., Ziegler, M.: Property testing in computational geometry. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 155–166. Springer, Heidelberg (2000)
Danzer, L., Branko, B.G.: Intersection properties of boxes in ℝd. Combinatorica 2(3), 237–246 (1982)
Eckhoff, J.: An upper bound theorem for families of convex sets. Geom. Dediata 19(75), 217–227 (1985)
Goldreich, O.: Combinatorial property testing (a survey). Electronic Colloquium on Computational Complexity (ECCC) 4(56) (1997)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45(4), 653–750 (1998)
Helly, E.: Über Mengen konvexer Köper mit gemeinschaftlichen Punkten (germen). Jahresber. Deutsch.Math. Verein (32), 175–176 (1923)
Jain, A.K., Dubes, R.C.: Algorithms for Clustering. Prentice-Hall (1988)
Kalai, G.: Intersection patterns of convex sets. Israel J. Math. (48), 161–174 (1984)
Katchalski, M., Nashtir, D.: On a conjecture of danzer and grunbaum. Proc. A.M.S (124), 3213–3218 (1996)
Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley (1990)
Katchalski, M., Liu, A.: A problem of geometry in ℝn. Proc. A.M.S (75), 284–288 (1979)
Ron, D.: Property testing: A learning theory perspective. Foundations and Trends in Machine Learning 1(3), 307–402 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakraborty, S., Pratap, R., Roy, S., Saraf, S. (2014). Helly-Type Theorems in Property Testing. In: Pardo, A., Viola, A. (eds) LATIN 2014: Theoretical Informatics. LATIN 2014. Lecture Notes in Computer Science, vol 8392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54423-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-54423-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54422-4
Online ISBN: 978-3-642-54423-1
eBook Packages: Computer ScienceComputer Science (R0)