Approximation algorithms for projective clustering

Journal of Algorithms

Volumn 46, Issue 2, 2003, Pages 115-139

  Agarwal, Pankaj K ^a   Procopiuc, Cecilia M ^b  

^a Duke University   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DATA COMPRESSION; DATABASE SYSTEMS; IMAGE PROCESSING; INFORMATION RETRIEVAL; PROBLEM SOLVING;

PROJECTIVE CLUSTERING; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 0037666042     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00295-X     Document Type: Article

References (40)

1. P.K. Agarwal, Partitioning arrangements of lines: II. Applications, Discrete Comput. Geom. 5 (1990) 533-573.
2. P.K. Agarwal, J. Erickson, Geometric range searching and its relatives, in: B. Chazelle, J.E. Goodman, R. Pollack (Eds.), Advances in Discrete and Computational Geometry, in: Contemp. Math., Vol. 223, Amer. Math. Soc., Providence, RI, 1999, pp. 1-56.
3. P.K. Agarwal, C.M. Procopiuc, K.R. Varadarajan, Approximation algorithms for k-line center, in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 54-63.
4. P.K. Agarwal, M. Sharir, Efficient randomized algorithms for some geometric optimization problems, Discrete Comput. Geom. 16 (1996) 317-337.
5. P.K. Agarwal, M. Sharir, Efficient algorithms for geometric optimization, ACM Comput. Surv. 30 (1998) 412-458.
6. P.K. Agarwal, M. Sharir, E. Welzl, The discrete 2-center problem, in: Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 147-155.
7. C.C. Aggarwal, C.M. Procopiuc, J.L. Wolf, P.S. Yu, J.S. Park, Fast algorithms for projected clustering, in: Proc. of ACM SIGMOD Intl. Conf. Management of Data, 1999, pp. 61-72.
8. R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan, Automatic subspace clustering of high-dimensional data for data mining applications, in: Proc. ACM SIGMOD Conf. on Management of Data, 1998, pp. 94-105.
9. S. Belongie, C. Carson, H. Greenspan, J. Malik, Color- and texture-based image segmentation using EM and its application to content-based image retrieval, in: Proc. ICCV, 1998, pp. 675-682.
10. S. Berchtold, C. Böhm, H.P. Kriegel, The pyramid-technique: Towards breaking the curse of dimensionality, in: Proc. of ACM SIGMOD Intl. Conf. Management of Data, 1998, pp. 142-153.
11. H. Brönnimann, M.T. Goodrich, Almost optimal set covers in finite VC-dimension, Discrete Comput. Geom. 14 (1995) 263-279.
12. T.M. Chan, Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus, in: Proc. 16th Annu. ACM Sympos. Comput. Geom., 2000, pp. 300-309.
13. M. Charikar, S. Guha, E. Tardos, D.B. Shmoys, A constant-factor approximation algorithm for the k-median problem, in: Proc. 31st Annu. ACM Sympos. Theory Comput., 1999, pp. 1-10.
14. B. Chazelle, Cutting hyperplanes for divide-and-conquer, Discrete Comput. Geom. 9 (1993) 145-158.
15. V. Chvátal, A greedy heuristic for the set-covering problem, Math. Oper. Res. 4 (1979) 233-235.
16. K.L. Clarkson, Algorithms for polytope covering and approximation, in: Proc. 3rd Workshop Algorithms Data Struct., in: Lecture Notes Comput. Sci., Vol. 709, Springer-Verlag, 1993, pp. 246-252.
17. C.A. Duncan, M.T. Goodrich, E.A. Ramos, Efficient approximation and optimization algorithms for computational metrology, in: Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 121-130.
18. H. Edelsbrunner, L.J. Guibas, J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comput. 15 (1986) 317-340.
19. C. Faloutsos, K.-I. Lin, FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia databases, in: Proc. ACM SIGMOD Conf. on Management of Data, 1995, pp. 163-173.
20. T. Feder, D.H. Greene, Optimal algorithms for approximate clustering, in: Proc. 20th Annu. ACM Sympos. Theory Comput., 1988, pp. 434-444.
21. S. Guha, R. Rastogi, K. Shim, CURE: An efficient clustering algorithm for large databases, in: Proc. ACM SIGMOD Intl. Conf. Management of Data, 1998, pp. 73-84.
22. R. Hassin, N. Megiddo, Approximation algorithms for hitting objects by straight lines, Discrete Appl. Math. 30 (1991) 29-42.
23. D. Haussler, E. Welzl, Epsilon-nets and simplex range queries, Discrete Comput. Geom. 2 (1987) 127-151.
24. M.E. Houle, G.T. Toussaint, Computing the width of a set, IEEE Trans. Pattern Anal. Mach. Intell. 10 (1988) 761-765.
25. P. Indyk, R. Motwani, P. Raghavan, S. Vempala, Locality-preserving hashing in multidimensional spaces, in: Proc. 29th Annu. ACM Sympos. Theory Comput., 1997, pp. 618-625.
26. J.W. Jaromczyk, M. Kowaluk, The two-line center problem from a polar view: A new algorithm and data structure, in: Proc. 4th Workshop Algorithms Data Struct., in: Lecture Notes Comput. Sci., Vol. 955, Springer-Verlag, 1995, pp. 13-25.
27. N. Katayama, S. Satoh, The SR-tree: An index structure for high-dimensional nearest neighbor queries, in: Proc. of ACM SIGMOD Intl. Conf. Management of Data, 1997, pp. 369-380.
28. L. Kaufman, P.J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis, Wiley, 1990.
29. D. Keim, S. Berchtold, C. Böhm, H.P. Kriegel, A cost model for nearest neighbor search in high-dimensional data space, in: Proc. 16th Sympos. Principles of Database Systems, 1997, pp. 78-86.
30. J. Kleinberg, Two algorithms for nearest-neighbor search in high dimension, in: Proc. 29th Annu. ACM Sympos. Theory Comput., 1997, pp. 599-608.
31. R. Kohavi, D. Sommerfield, Feature subset selection using the wrapper method: Overfitting and dynamic search space topology, in: Proc. 1st Intl. Conf. on Knowledge Discovery and Data Mining, 1995.
32. D.T. Lee, Y.F. Wu, Geometric complexity of some location problems, Algorithmica 1 (1986) 193-211.
33. J.-H. Lin, J.S. Vitter, Approximation algorithms for geometric median problems, Inform. Process. Lett. 44 (1992) 245-249.
34. G.J. McLachlan, K.E. Basford, Mixture Models, Dekker, 1988.
35. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30 (1983) 852-865.
36. N. Megiddo, A. Tamir, On the complexity of locating linear facilities in the plane, Oper. Res. Lett. 1 (1982) 194-197.
37. R.T. Ng, J. Han, Efficient and effective clustering methods for spatial data mining, in: Proc. 20th Intl. Conf. Very Large Databases, 1994, pp. 144-155.
38. J. Pach, P.K. Agarwal, Combinatorial Geometry, Wiley, New York, 1995.
39. J. Shafer, R. Agrawal, M. Mehta, Sprint: A scalable parallel classifier for data mining, in: Proc. 22nd Intl. Conf. Very Large Databases, Kauffman, 1996.
40. D.A. White, R. Jain, Similarity indexing with the SS-tree, in: Proc. 12th Intl. Conf. Data Engineering, 1996, pp. 516-523.