Assessing data mining results via swap randomization

ACM Transactions on Knowledge Discovery from Data

Volumn 1, Issue 3, 2007, Pages

  Gionis, Aristides ^a   Mannila, Heikki ^b   Mielikäinen, Taneli ^c,e   Tsaparas, Panayiotis ^d  

^a YAHOO RESEARCH   (Spain)

^b UNIVERSITY OF HELSINKI   (Finland)

^c NOKIA RESEARCH CENTER   (United States)

^d MICROSOFT RESEARCH   (United States)

^e NOKIA RESEARCH CENTER   (United States)

Author keywords

0 1 data; Randomization tests; Significance testing; Swaps

Indexed keywords

DATA MINING ALGORITHMS; RANDOMIZATION TECHNIQUES; RANDOMIZATION TESTS; SIGNIFICANCE TESTING;

ALGORITHMS; CORRELATION METHODS; PROBLEM SOLVING; RANDOM PROCESSES; SPECTRUM ANALYSIS; STATISTICAL TESTS;

DATA MINING;

EID: 37049039428     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1297332.1297338     Document Type: Conference Paper

References (21)

1. BESAG, J. 2004. Markov chain Monte Carlo methods for statistical inference, http://www.ims.nus.edu.sg/Programs/mcmc/files/besag.tl.pdf.
2. BESAG, J. AND CLIFFORD, P. 1989. Generalized Monte Carlo significance tests. Biometrika 76, 4, 633-642.
3. BESAG, J. AND CLIFFORD, P. 1991. Sequential Monte Carlo p-values. Biometrika 78, 2, 301-304.
4. BEZÁKOVÁ, I., BHATNAGAR, N., AND VIGODA, E. 2006. Sampling binary contingency tables with a greedy start. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SLAM, 414-423.
5. BEZÁKOVÁ, I., SINCLAIR, A., STEFANKOVIC, D., AND VIGODA, E. 2006. Negative examples for sequential importance sampling of binary contingency tables. http://arxiv.org/abs/math.ST/0606650.
6. BRIJS, T., SWINNEN, G., VANHOOF, K., AND WETS, G. 1999. Using association rules for product assortment decisions: A case study. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, 254-260.
7. BRIN, S., MOTWANI, R., AND SILVERSTEIN, C. 1997. Beyond market baskets: Generalizing association rules to correlations. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Tucson, AZ, 265-276.
8. CALDERS, T. 2004. Computational complexity of itemset frequency satisfiability. In Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 143-154.
9. CHEN, Y., DIACONIS, P., HOLMES, S. P., AND LIU, J. S. 2005. Sequential Monte Carlo methods for statistical analysis of tables. J. Amer. Statis. Assoc. 100, 469, 109-120.
10. COBB, G. W. AND CHEN, Y.-P. 2003. An application of Markov chain Monte Carlo to community ecology. Amer. Math. Month. 110, 264-288.
11. DIACONIS, P. AND GANGOLLI, A. 1995. Rectangular arrays with fixed margins. In Discrete Probability and Algorithms, 15-41.
12. DIACONIS, P. AND SALOFF-COSTE, L. 1995. Random walk on contingency tables with fixed row and column sums. Tech. Rep., Department of Mathematics, Harvard University.
13. DUMOUCHEL, W AND PREGIBON, D. 2001. Empirical Bayes screening for multi-item associations. In Knowledge Discovery and Data Mining, 67-76.
14. DYER, M. 2003. Approximate counting by dynamic programming. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, 693-699.
15. FORTELIUS, M. 2006. Neogene of the old world database of fossil mammals (NOW). http://www.helsinki.fi/science/now/.
16. GOOD, P. 2000. Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses. Springer.
17. HASTINGS, W K. 1970. Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 1, 97-109.
18. JAROSZEWICZ, S. AND SIMOVICI, D. A. 2001. A general measure of rule interestingness. In Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD), 253-265.
19. KASHTAN, N., ITZKOVITZ, S., MILO, R., AND ALON, U. 2004. Efficient sampling algorithm for estimating dubgraph concentrations and detecting network motifs. Bioinf. 20, 11, 1746-1758.
20. LIU, B., HSU, W., AND MA, Y. 1999. Pruning and summarizing the discovered associations. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, 125-134.
21. LIU, B., HSU, W., AND MA, Y. 2001. Identifying non-actionable association rules. In Knowledge Discovery and Data Mining, 329-334.