Evaluating query result significance in databases via randomizations

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 906-917

  Ojala, Markus ^a   Garriga, Gemma C ^a   Gionis, Aristides ^b   Mannila, Heikki ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

^b YAHOO RESEARCH   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

MOTION PICTURES; QUERY LANGUAGES; QUERY PROCESSING;

EXPLORATORY DATA ANALYSIS; INTERNET MOVIE DATABASE; QUERY RESULTS; RANDOMIZATION TECHNIQUES; RELATIONAL DATA; RELATIONAL MODEL; RELATIONAL QUERIES; STRUCTURED DATA;

DATA MINING;

EID: 84857178959     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.79     Document Type: Conference Paper

References (20)

1. Y. Benjamini and Y. Hochberg. Controlling the false discovery rate: A practical and powerful approach to multiple testing. Journal of the Royal Statistical Society. Series B (Methodological), 57(1):289-300, 1995.
2. J. Besag. Markov chain Monte Carlo methods for statistical inference. http://www.ims.nus.edu.sg/Programs/mcmc/files/besag-tl.pdf, 2004.
3. J. Besag and P. Clifford. Generalized Monte Carlo significance tests. Biometrika, 76(4):633-642, 1989.
4. J. Besag and P. Clifford. Sequential Monte Carlo p-values. Biometrika, 78(2):301-304, 1991.
5. G. Casella and R. Berger. Statistical Inference. Duxbury Resource Center, 2001.
6. Y. Chen, P. Diaconis, S. P. Holmes, and J. S. Liu. Sequential MC methods for statistical analysis of tables. Journal of the American Statistical Association, 100(469):109-120, 2005.
7. G. W. Cobb and Y-P. Chen. An application of Markov chain Monte Carlo to community ecology. The American Mathematical Monthly, 110:265-288, 2003.
8. O. de Moor, D. Sereni, P. Avgustinov, and M. Verbaere. Type inference for datalog and its application to query optimisation. In PODS'08, pages 291-300, 2008.
9. B. Efron. Bootstrap methods: Another look at the jackknife. The Annals of Statistics, 7(1):1-26, 1979.
10. A. Gionis, H. Mannila, T. Mielikäinen, and P. Tsaparas. Assessing data mining results via swap randomization. ACM TKDD, 1(3), 2007.
11. P. I. Good. Permutation tests: a practical guide to resampling methods for testing hypotheses; Springer series in statistics., Volume 2nd. Springer, 2000.
12. S. Holm. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 6:65-70, 1979.
13. A. Jha, V. Rastogi, and D. Suciu. Query evaluation with softkey constraints. In PODS'08, pages 119-128, 2008.
14. N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics, 20(11):1746-1758, 2004.
15. M. Ojala, N. Vuokko, A. Kallio, N. Haiminen, and H. Mannila. Randomization methods for assessing data analysis results on real-valued matrices. Statistical Analysis and Data Mining, 2(4):209-230, 2009.
16. R. Ramakrishnan and J. Gehrke. Database Management Systems. McGraw-Hill Higher Ed., 2003.
17. H. J. Ryser. Combinatorial properties of matrices of zeros and ones. Canad. J. Math., 9:371-377, 1957.
18. C. Silverstein, S. Brin, and R. Motwani. Beyond market baskets: Generalizing association rules to dependence rules. DMKD, 2(1):39-68, 1998.
19. P-N. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In KDD '02, pages 32-41, 2002.
20. G. I. Webb. Discovering significant patterns. Mach. Learn., 68(1):1-33, 2007.