Measuring independence of datasets

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 271-280

  Braverman, Vladimir ^a   Ostrovsky, Rafail ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

data streams; dimension reduction; randomized algorithms; theory of computation

Indexed keywords

DATA SETS; DATA STREAM; DATA STREAM MODEL; DIMENSION REDUCTION; JOINT DISTRIBUTIONS; NEW RESULTS; OPEN PROBLEMS; PRODUCT DISTRIBUTIONS; RANDOMIZED ALGORITHMS; SINGLE PASS; STATISTICAL DISTANCE; STREAMING MODEL; SUBLINEAR; THEORY OF COMPUTATION;

APPROXIMATION ALGORITHMS; DATA COMMUNICATION SYSTEMS; HYDRAULICS;

COMPUTATION THEORY;

EID: 77954702541     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806728     Document Type: Conference Paper

References (28)

1. N. Alon, A. Andoni, T. Kaufman, K. Matulef, R. Rubinfeld, N. Xie, "Testing k-wise and almost k-wise independence," Proceedings of the ACM symposium on Theory of computing, 2007, pp. 496-Ucombining double acute accent505.
2. N. Alon, O. Goldreich, Y. Mansour, "Almost k-wise independence versus k-wise independence," Inform. Process. Lett., 88:107Ucombining double acute accent110, 2003.
3. N. Alon, Y. Matias, M.Szegedy, "The space complexity of approximating the frequency moments". Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp.20-29, 1996.
4. T. Batu, L. Fortnow, E. Fischer, R. Kumar, R. Rubinfeld, P. White, "Testing random variables for independence and identity," FOCS, 2001, pp. 442Ucombining double acute accent-451.
5. T. Batu, L. Fortnow, R. Rubinfeld, W. D. Smith, P. White, "Testing that distributions are close," Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p.259, 2000.
6. T. Batu, R. Kumar, R. Rubinfeld, "Sublinear algorithms for testing monotone and unimodal distributions," In Proc. 36th Annual ACM Symposium on the Theory of Computing, pp. 381-Ucombining double acute accent390, 2004.
7. L. Bhuvanagiri, S. Ganguly, D. Kesh, C. Saha, "Simpler algorithm for estimating frequency moments of data streams," in ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 708Ucombining double acute accent-713.
8. V. Braverman, K.-M. Chung, Z. Liu, M. Mitzenmacher, R. Ostrovsky, "AMS Without 4-Wise Independence on Product Domains," STACS 2010.
9. V. Braverman, R. Ostrovsky, "Effective Computations on Sliding Windows," SIAM J. Comput. Volume 39, Issue 6, pp. 2113-2131 (2010).
10. V. Braverman, R. Ostrovsky, "Smooth Histograms for Sliding Windows," In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (October 21-23, 2007).
11. V. Braverman, R. Ostrovsky, "Measuring Independence of Datasets," http://arxiv.org/abs/0903.0034.
12. V.Braverman, R.Ostrovsky, "Zero-One Frequency Laws," STOC 2010.
13. V. Braverman, R. Ostrovsky, C. Zaniolo, "Optimal sampling from sliding windows," In Proceedings of the Twenty-Eighth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (Providence, Rhode Island, USA, June 29 - July 01, 2009).
14. M. Charikar, K. Chen, M. Farach-Colton, "Finding frequent items in data streams," Theoretical Computer Science, v.312 n.1, p.3-15, 2004.
15. G. Cormode and S. Muthukrishnan. "An Improved Data Stream Summary: The Count-Min Sketch and its Applications". J. Algorithms, 55(1):58Ucombining double acute accent75, April 2005.
16. G. Cormode, S. Muthukrishnan, "What's New: Finding Significant Differences in Network Data Streams," INFOCOM 2004.
17. J. Feigenbaum, S. Kannan, M. Strauss, M. Viswanathan, "An Approximate L1-Difference Algorithm for Massive Data Streams," Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.501, 1999.
18. S. Ganguly, G. Cormode, "On Estimating Frequency Moments of Data Streams," APPROX-RANDOM 2007.
19. I. F. Ilyas, V. Markl , P. Haas, P. Brown, A. Aboulnaga, "CORDS: automatic discovery of correlations and soft functional dependencies," SIGMOD 2004.
20. P. Indyk, "Stable distributions, pseudorandom generators, embeddings, and data stream computation," J. ACM, 53 (2006), pp. 307-Ucombining double acute accent323.
21. P. Indyk, A. McGregor, "Declaring Independence via the Sketching of Sketches," ACM-SIAM Symposium on Discrete Algorithms, 2008.
22. P. Indyk, D. P. Woodruff, "Optimal approximations of the frequency moments of data streams," in ACM Symposium on Theory of Computing, 2005, pp. 202Ucombining double acute accent-208.
23. R. Kimball, Joe Caserta, "The Data Warehouse ETL Toolkit: Practical Techniques for Extracting, Cleanin," John Wiley & Sons, 2004.
24. α; (0 ≤ α ≤ 2) using stable random projections," SODA 2008.
25. S. Muthukrishnan, "Data Streams: Algorithms And Applications," Foundations and Trends in Theoretical Computer Science, Volume 1, Issue 2.
26. V. Poosala, Y. E. Ioannidis, "Selectivity Estimation Without the Attribute Value Independence Assumption," Proceedings of the 23rd International Conference on Very Large Data Bases, pp.486-495, 1997.
27. R. Rubinfeld, R. A. Servedio, "Testing monotone high-dimensional distributions," In Proc. 37th Annual ACM Symposium on the Theory of Computing, pp. 147-156, 2005.
28. A. Sahai, S. Vadhan, "Manipulating statistical difference," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 43., pp. 251-270.