Randomization methods for assessing data analysis results on real-valued matrices

Statistical Analysis and Data Mining

Volumn 2, Issue 4, 2009, Pages 209-230

  Ojala, Markus ^a   Vuokko, Niko ^a   Kallio, Aleksi ^b   Haiminen, Niina ^c,d   Mannila, Heikki ^a,c  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

^b CSC Scientific Computing Ltd   (Finland)

^c UNIVERSITY OF HELSINKI   (Finland)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Data mining; DNA microarray; Markov chain Monte Carlo; Randomization tests; Real valued matrix; Significance testing

Indexed keywords

DATA HANDLING; GENE EXPRESSION; MARKOV PROCESSES; MATRIX ALGEBRA; MONTE CARLO METHODS; STATISTICAL TESTS;

DNA MICROARRAY; GENES EXPRESSION; MARKOV CHAIN MONTE CARLO; MARKOV CHAIN MONTE-CARLO; MATRIX; RANDOMISATION; RANDOMIZATION TESTS; REAL-VALUED MATRIX; SAMPLE DATASET; SIGNIFICANCE TESTING;

DATA MINING;

EID: 77950233355     PISSN: 19321872     EISSN: 19321864     Source Type: Journal    
DOI: 10.1002/sam.10042     Document Type: Article

References (41)

1. P. Good, Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses, New York, Springer, 2000.
2. J. Besag and P. Clifford, Generalized Monte Carlo significance tests, Biometrika 76(4) (1989), 633-642.
3. J. Besag. Markov chain Monte Carlo methods for statistical inference, http://www.ims.nus.edu.sg/Programs/mcmc/files/besagtl.pdf, 2004.
4. G. W. Cobb and Y. P. Chen, An application of Markov chain Monte Carlo to community ecology, Am Math Mon 110 (2003), 265-288.
5. H. J. Ryser, Combinatorial properties of matrices of zeros and ones, Can J Math 9 (1957), 371-377.
6. A. Gionis, H. Mannila, T. Mielikäinen, and P. Tsaparas, Assessing data mining results via swap randomization, ACM Trans Knowl Discov Data 1(3) (2007).
7. Y. Chen, P. Diaconis, S. P. Holmes, and J. S. Liu, Sequential Monte Carlo methods for statistical analysis of tables, J Am Stat Assoc 100(469) (2005), 109-120.
8. I. Bezáková, N. Bhatnagar, and E. Vigoda, Sampling binary contingency tables with a greedy start, In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, SIAM, Miami, Florida, 2006, 414-423.
9. M. Dyer, Approximate counting by dynamic programming, In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, ACM, San Diego, June 9-11 2003, 2003, 693-699.
10. N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon, Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs, Bioinformatics 20(11) (2004), 1746-1758.
11. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, Network motifs: simple building blocks of complex networks, Science 298 (2002), 824-827.
12. M. Ojala, N. Vuokko, A. Kallio, N. Haiminen, and H. Mannila, Randomization of real-valued matrices for assessing the significance of data mining results, In SDM '08: Proceedings of the SIAM International Conference on Data Mining, SIAM, Atlanta, Georgia, 2008, 494-505.
13. S. Brin, R. Motwani, and C. Silverstein, Beyond market baskets: Generalizing association rules to correlations, In SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, ACM, Tucson, 1997, May 13-15, 1997, 265-276.
14. B. Liu, W. Hsu, and Y. Ma, Pruning and summarizing the discovered associations, In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, San Diego, 1999, August 15-18 1999, 125-134.
15. B. Liu, W. Hsu, and Y. Ma, Identifying non-actionable association rules, In Knowledge Discovery and Data Mining, 2001, 329-334.
16. H. Xiong, S. Shekhar, P. N. Tan, and V. Kumar, Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pairs, In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, Seattle, 2004, August 22-25 2004, 334-343.
17. N. Megiddo and R. Srikant, Discovering predictive association rules, In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), New York, AAAI Press, 1998, August 27-31, 1998, 274-278.
18. W. DuMouchel and D. Pregibon. Empirical Bayes screening for multi-item associations, In Knowledge Discovery and Data Mining, 2001, 67-76.
19. S. Jaroszewicz and D. A. Simovici, A general measure of rule interestingness, In 5th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2001), Freiburg, Germany, 2001, 253-265.
20. A. Ukkonen and H. Mannila, Finding outlying items in sets of partial rankings, In PKDD, 2007, 265-276.
21. J. E. Moore and R. K. Swihart, Toward ecologically explicit null models of nestedness, Oecologia 152(4) (2007), 763-777.
22. W. Ulrich and N. J. Gotelli, Disentangling community patterns of nestedness and species co-occurrence, Oikos 116(12) (2007), 2053-2061.
23. W. Ulrich and N. J. Gotelli, Null model analysis of species nestedness patterns, Ecology 88(7) (2007), 1824-1831.
24. M. J. Wonham and E. Pachepsky, A null model of temporal trends in biological invasion records, Ecology Letters 9(6) (2006), 663-672.
25. A. Waldron, Null models of geographic range size evolution reaffirm its heritability, Am Nat 170(2) (2007), 221-231.
26. P. Diaconis and A. Gangolli, Rectangular arrays with fixed margins, In Discrete Probability and Algorithms, 1995, 15-41.
27. T. A. B. Snijders, Enumeration and simulation methods for 01511 matrices with given marginals, Psychometrika 56 (1991), 397-417.
28. B. Y. Wang and F. Zhang, On the precise number of (0,1)-matrices in U(R,S), Discrete Math 187 (1998), 211-220.
29. I. Bezáková, A. Sinclair, D. Stefankovic, and E. Vigoda. Negative Examples for Sequential Importance Sampling of Binary Contingency Tables, http://arxiv.org/abs/math.ST/0606650, 2006.
30. J. G. Sanderson, Testing ecological patterns, Am Sci 88 (2000), 332-339.
31. J. Besag and P. Clifford, Sequential Monte Carlo p-values, Biometrika 78(2) (1991), 301-304.
32. Y. Benjamini and Y. Hochberg, Controlling the false discovery rate: A practical and powerful approach to multiple testing, J R Stat Soc Series B Methodological 57(1) (1995), 289-300.
33. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, M. Teller, and E. Teller, Equations of state calculations by fast computing machines, J Chem Phys 21 (1953), 1087-1092.
34. W. K. Hastings, Monte Carlo sampling methods using Markov chains and their applications, Biometrika 57 (1970), 97-109.
35. S. Kullback and R. Leibler, On information and sufficiency, Ann Math Stat 22(1) (1951), 79-86.
36. S. H. Cha and S. N. Srihari, On measuring the distance between histograms, Pattern Recognit 35(6) (2002), 1355-1370.
37. U.Scherf,D.T.Ross,M.Waltham,L.H.Smith,J.K.Lee, L. Tanabe, K. W. Kohn, W. C. Reinhold, T. G. Myers, D. T. Andrews, D. A. Scudiero, M. B. Eisen, E. A. Sausville, Y. Pommier, D. Botstein, P. O. Brown and J. N. Weinstein, A gene expression database for the molecular pharmacology of cancer, Nat Genet 24 (2000), 236-244.
38. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets, Using association rules for product assortment decisions: A case study, In Knowledge Discovery and Data Mining, 1999, 254-260.
39. D. Arthur and S. Vassilvitskii, K-means++: the advantages of careful seeding, In SODA '07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 2007, 1027-1035.
40. A. Brazma and J. Vilo, Gene expression data analysis, Microbes Infect 3 (2001), 823-829.
41. D. J. Earl and M. W. Deem, Parallel tempering: theory, applications, and new perspectives, Phys Chem Chem Phys 7 (2005), 3910-3916.