Maintaining Variance and k-Medians over Data Stream Windows

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 22, Issue , 2003, Pages 234-243

  Babcock, Brian ^a   Datar, Mayur ^a   Motwani, Rajeev ^a   O'Callaghan, Liadan ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; DATA MINING; ELECTRONIC COMMERCE; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; QUERY LANGUAGES;

DATA SETS; DATA STREAM WINDOWS; SENSOR NETWORKS;

DATA REDUCTION;

EID: 1142293244     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773176     Document Type: Conference Paper

References (22)

1. V. Arya, N. Garg, R. Khandekar, V. Pandit, A. Meyerson, and K. Munagala. "Local Search Heuristics for k-median and Facility Location Problems. " In Proc. 33rd ACM Symp. on Theory of Computing (STOC), 2001, pages 21-29.
2. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. "Models and Issues in Data Stream Systems." In Proceedings of the 21st ACM Symposium on Principles of Databases Systems (PODS), 2002, pages 1-16.
3. B. Babcock, M. Datar, and R. Motwani. "Sampling from a Moving Window over Streaming Data." In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pages 633-634.
4. P. S. Bradley, U. M. Fayyad, and C. Reina. "Scaling clustering algorithms to large databases." In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD), 1998, pages 9-15.
5. M. Charikar and S. Guha. "Improved Combinatorial Algorithms for the Facility Location and k-median Problems." In Proc. of the 40th Annual IEEE Symposium on Foundations of Computer Science(FOCS), 1999, pages 378-388.
6. M. Charikar, L. O'Callaghan, and R. Panigrahy. "Better Streaming Algorithms for Clustering Problems." In Proc. of 35th ACM Symposium on Theory of Computing (STOC), 2003.
7. M. Datar, A. Gionis, P. Indyk, and R. Motwani. "Maintaining Stream Statistics over Sliding Windows." In Proceedings of Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pages 635-644.
8. P. Domingos and G. Hulten. "Mining High-speed Data Streams." In Proceedings of the 6th International Conference on Knowledge Discovery and Data Mining (KDD), 2000, pages 71-80.
9. P. Domingos, G. Kulten, and L. Spencer. "Mining Time-changing Data Streams." In Proceedings of the 7th International Conference on Knowledge Discovery and Data Mining (KDD), 2001, pages 97-106.
10. P. Gibbons, and S. Tirthapura. "Distributed Streams Algorithms for Sliding Windows" In Proc. of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2002.
11. A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. "Surfing Wavelets on Streams: One-pass Summaries for Approximate Aggregate Queries. " In Proc. 27th Conf. on Very Large Data Bases (VLDB), 2001, pages 79-88.
12. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. "Clustering Data Streams." In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2000, pages 359-366.
13. S. Guha, R. Rastogi, and K. Shim. "CURE: An efficient clustering algorithm for large databases." In Proc. of the ACM SIGMOD Intl. Conference on Management of Data (SIGMOD), 1998, pages 73-84.
14. M.R. Henzinger, P. Raghavan, and S. Rajagopalan "Computing on Data Streams.", Technical Report 1998-011, Compaq Systems Research Center, Palo Alto, CA, May, 1998.
15. P. Indyk. "Sublinear Time Algorithms for Metric Space Problems." In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), 1999, pages 428-434.
16. K. Jain and V. Vazirani. "Primal-Dual Approximation Algorithms for Metric Facility Location and k-median Problems." In Proc. 40th IEEE Symp. on Foundations of Computer Science (FOCS), 1999, pages 1-10.
17. R. R. Mettu and C. G. Plaxton. "The Online k-median Problem." In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2000, pages 339-348.
18. N. Mishra, D. Oblinger, and L. Pitt. "Sublinear Time Approximate Clustering." In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pages 439-447.
19. L. O'Callaghan, N. Mishra, A. Meyerson, S. Guha, and R. Motwani. "Streaming-Data Algorithms for High-Quality Clustering." In Proceedings of the 18th Annual IEEE International Conference on Data Engineering (ICDE), 2001.
20. C. R. Palmer and C. Faloutsos. "Density biased sampling: an improved method for data mining and clustering." In Proc. of the ACM SIGMOD Intl. Conference on Management of Data (SIGMOD), 2000, pages 82-92.
21. D. Pelleg and A. W. Moore. "Accelerating exact k-means algorithms with geometric reasoning." In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining (KDD), 1999.
22. T. Zhang, R. Ramakrishnan, and M. Livny. "BIRCH: an efficient data clustering method for very large databases." In Proc. of the ACM SIGMOD Intl. Conference on Management of Data (SIGMOD), 1996, pages 103-114.