Tell me something i don't know: Randomization strategies for iterative data mining

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2009, Pages 379-387

  Hanhijärvi, Sami ^a   Ojala, Markus ^a   Vuokko, Niko ^a   Puolamäki, Kai ^a   Tatti, Nikolaj ^a   Mannila, Heikki ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Algorithms; Experimentation; Theory

Indexed keywords

CLUSTER CENTERS; CLUSTER STRUCTURE; CO-OCCURRENCE; DATA MATRICES; DATA MINING METHODS; DATA MINING PROCESS; DATA SETS; EXPERIMENTATION; EXPLORATORY DATA ANALYSIS; FREQUENT PATTERN DISCOVERY; METROPOLIS SAMPLING; RANDOM SAMPLE; SAMPLE DATA; THEORY;

DATA MINING; EXPERIMENTS; MINING; SET THEORY;

CLUSTER ANALYSIS;

EID: 70350663120     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557065     Document Type: Conference Paper

References (20)

1. Yoav Benjamini and Yosef 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. Julian Besag. Markov chain Monte Carlo methods for statistical inference. http://www.ims.nus.edu.sg/ Programs/mcmc/files/besag\tl.pdf, 2004.
3. Julian Besag and Peter Clifford. Generalized Monte Carlo significance tests. Biometrica, 76(4):633-642, 1989.
4. T. Calders and B. Goethals. Non-derivable itemset mining. Data Mining and Knowledge Discovery, 14(1):171-206, 2007.
5. G. W. Cobb and Y.-P. Chen. An application of markov chain monte carlo to community ecology. American Mathematical Monthly, (110):264-288, 2003.
6. Mikael Fortelius and Jussi Eronen. Now - neogene of the old world. http://www.helsinki.fi/science/now/, 2005. Database of fossil mammals.
7. Arianna Gallo, Tijl Bie, and Nello Cristianini. Mini: Mining informative non-redundant itemsets. In Proc. of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases, 2007.
8. Charles J. Geyer. Markov chain monte carlo maximum likelihood. In Computing Science and Statistics: Proc. of 23rd Symposium on the Interface Foundation, 1991.
9. Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, and Panayiotis Tsaparas. Assessing data mining results via swap randomization. ACM Transactions on Knowledge Discovery from Data, 1(3), 2007.
10. Phillip Good. Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses. Springer-Verlag, 2000.
11. S. Holm. A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 1979.
12. Szymon Jaroszewicz. Interactive hmm construction based on interesting sequences. In Local Patterns to Global Models (LeGo'08) Workshop at the the European Conference on Principles and Practice of Knowledge Discovery in Databases, 2008.
13. David Jensen. Knowledge discovery through induction with randomization testing. In Proc. of the 1991 Knowledge Discovery in Databases Workshop, 1991.
14. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculation by fast computing machines. Journal of Chemical Physics, 21(1):1087-91, 1953.
15. Taneli Mielikäinen and Heikki Mannila. The pattern ordering problem. Lecture Notes in Computer Science, 2838:327-338, 2003.
16. Markus Ojala, Niko Vuokko, Aleksi Kallio, Niina Haiminen, and Heikki Mannila. Randomization of real-valued matrices for assessing the significance of data mining results. In Proc. of the 2008 SIAM International Conference on Data Mining, 2008.
17. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
18. Geoffrey I. Webb. Discovering significant patterns. Mach. Learn., 68(1):1-33, 2007.
19. Geoffrey I. Webb. Layered critical values: A powerful direct-adjustment approach to discovering significant patterns. Machine Learning, 71(2{3):307-323, 2008.
20. Peter H. Westfall and S. Stanley Young. Resampling-based multiple testing: examples and methods for p-value adjustment. Wiley, 1993.