Tight results for clustering and summarizing data streams

ACM International Conference Proceeding Series

Volumn 361, Issue , 2009, Pages 268-275

  Guha, Sudipto ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURATE ESTIMATION; APPROXIMATION FACTOR; DATA STREAM; K-CENTER; LOWER BOUNDS; NON-TRIVIAL; RUNNING TIME; SINGLE PASS; SPACE BOUNDS; UPPER BOUND;

CLUSTERING ALGORITHMS; CONTROL THEORY; DATA COMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 70349152187     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514926     Document Type: Conference Paper

References (23)

1. S. Acharya, P. Gibbons, V. Poosala, and S. Ramaswamy. The Aqua Approximate Query Answering System. Proc. of ACM SIGMOD, pages 574-576, 1999.
2. V. Arya, N. Garg, R. Khandekar, and V. Pandit. Local search heuristics for k-median and facility location problems. In Proc. STOC, 2001 (to appear).
3. M. Bertolotto and M. J. Egenhofer. Progressive vector transmission. Proc, of the 7th ACM symposium on Advances in Geographical Information Systems, pages 152-157, 1999.
4. C. Buragohain, N. Shrivastava, and S. Suri. Space efficient streaming algorithms for the maximum error histogram. Proc of. ICDE, pages 1026-1035, 2007.
5. K. Chakrabarti, E. J. Keogh, S. Mehrotra, and M. J. Pazzani. Locally adaptive dimensionality reduction for indexing large time series databases. ACM TODS, 27(2):188-228, 2002.
6. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. In Proc. STOC, pages 626-635, 1997.
7. M. Charikar, L. O'Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. Proc, of STOC, pages 30-39, 2003.
8. * n-hard to approximate. J. ACM, 52(4):538-551, 2005.
9. M. N. Garofalakis and P. B. Gibbons. Wavelet synopses with error guarantees. Proc, of ACM SIGMOD, pages 476-487, 2002.
10. S. Guha. Space efficiency in synopsis construction problems. Proc, of VLDB Conference, pages 409-420, 2005.
11. S. Guha and B. Harb. Approximation algorithms for wavelet transform coding of data streams. IEEE Trans. of Info. Theory, 2008.
12. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. In Proc. STOC, pages 471-475, 2001.
13. S. Guha, N. Koudas, and K. Shim. Approximation and streaming algorithms for histogram construction problems. ACM TODS, 31(1), 2006.
14. S. Guha, A. Meyerson, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams: Theory and practice. IEEE Trans. Knowl. Data Eng., 15(3):515-528, 2003.
15. S. Guha and K. Shim. A note on linear time algorithms for the maximum error problem. IEEE Trans. Knowl. Data Eng., 19(7):993-997, 2007.
16. S. Guha, K. Shim, and J. Woo. REHIST: Relative error histogram construction algorithms. Proc. VLDB Conference, pages 300-311, 2004.
17. D. S. Hochbaum and D. B. Shmoys. A unified approach to approximation algorithms for bottleneck problems. J. ACM, 33(3):533-550, 1986.
18. Y. E. Ioannidis. Universality of serial histograms. Proc, of the VLDB Conference, pages 256-267, 1993.
19. H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal Histograms with Quality Guarantees. Proceedings of VLDB, pages 275-286, Aug. 1998.
20. P. Karras, D. Sacharidis, and N. Mamoulis. Exploiting duality in summarization with deterministic guarantees. Proc, of KDD, 2007.
21. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
22. J. Matousek. Lectures on Discrete Geometry. Springer, GTM series, 2002.
23. A. Meyerson. Online facility location. Proc. FOCS, 2001.