Measuring independence of datasets

DOI10.1145/1806689.1806728MaRDI QIDQ2875153zbMATH OpenOpenAlexFDO

Authors Vladimir Braverman, Rafail Ostrovsky

Publication date 13 August 2014

Published in Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.9287

zbMATH Keywords

dimension reductionrandomized algorithmsdata streamstheory of computation

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Database theory (68P15)

Recommendations

• Measures of Dependence and Tests of Independence
• A new class of measures for testing independence
• Testing the independence of sets of large-dimensional variables
• Testing independence in high dimensions
• Testing for independence in arbitrary distributions
• A nonparametric measure of independence under a hypothesis of independent components
• Kernel methods for measuring independence

Cited in

(4)

• AMS without 4-wise independence on product domains
• Approximating subadditive Hadamard functions on implicit matrices
• Continuous monitoring of \(\ell_p\) norms in data streams
• Evaluating Bayesian networks via data streams

This page was built for publication: Measuring independence of datasets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875153)