Randomization techniques for graphs

Society for Industrial and Applied Mathematics - 9th SIAM International Conference on Data Mining 2009, Proceedings in Applied Mathematics

Volumn 2, Issue , 2009, Pages 776-787

  Hanhijärvi, Sami ^a   Garriga, Gemma C ^a   Puolamäki, Kai ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE ALGORITHMS; DATA MINING METHODS; FREQUENT SUBGRAPH MINING; GRAPH CLUSTERING; GRAPH DATA; INPUT GRAPHS; METROPOLIS SAMPLING; MINING ALGORITHMS; RANDOMIZATION TECHNIQUES; RESEARCH AREAS; SAMPLE DATA; STATISTICAL HYPOTHESIS TESTING; STATISTICAL SIGNIFICANCE; UNDIRECTED GRAPH;

CLUSTERING ALGORITHMS; DATA MINING; MINING; TESTING;

GRAPH THEORY;

EID: 72749100026     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. Dimitri P. Bertsekas. Network Optimization: Continuous and Discrete Model. MIT Press, 1998.
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), 1989.
4. Julian Besag and Peter Clifford. Sequential Monte Carlo p-values. Biometrica, 78(2), 1991.
5. J. Cook and L. Holder. Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research, 1:231-255, 1994.
6. Camil Demetrescu and Giuseppe F. Italiano. A new approach to dynamic all pairs shortest paths. Journal of the ACM, 51(6), 2004.
7. Inderjit Dhillon, Yuqiang Guan, and Brian Kulis. A fast kernel-based multilevel algorithm for graph clustering. In Proc. of the 11th ACM Conference on Knowledge Discovery and Data Mining (KDD), 2005.
8. Sandrine Dudoit, Juliet Popper Shaffer, and Jennifer C. Boldrick. Multiple hypothesis testing in microarray experiments. Statistical Science, 18(1), 2003.
9. Eugene S. Edgington. Randomization Tests. Marcel Dekker, Inc., New York, 3rd edition, 1995.
10. Lise Getoor and Christopher P. Diehl. Link mining: a survey. ACM SIGKDD Explorations Newsletter, 7(2), 2005.
11. Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, and Panayiotis Tsaparas. Assessing data mining results via swap randomization. In Proc. of the 12th ACM Conference on Knowledge Discovery and Data Mining (KDD), 2006.
12. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. PNAS, 99(12), 2002.
13. Jiawei Han, Hong Cheng, Dong Xin, and Xifeng Yan. Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery, 15, 2007.
14. David Hand, Heikki Mannila, and Padhraic Smyth. Principles of Data Mining. MIT Press, 2001.
15. W. K. Hastings. Monte Carlo sampling methods using Markov chains and their applications. Biometrica, 57, 1970.
16. Mehmet Koyutürk, Wojciech Szpankowski, and Ananth Grama. Assessing significance of connectivity and conservation in protein interaction networks. Journal of Computational Biology, 14(6), 2007.
17. Michihiro Kuramochi and George Karypis. An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowl. Data Eng., 16(9), 2004.
18. Pierre Legendre and Louis Legendre. Numerical Ecology. Elsevier Science, 1998.
19. Jure Leskovec and Christos Faloutsos. Sampling from large graphs. In SICKDD International Conference of Knowledge Discovery and Data Mining, 2006.
20. Bryan F.J. Manly. Randomization, Bootstrap And Monte Carlo Methods in Biology. Chapman & Hall, 3rd edition, 2007.
21. 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), 1953.
22. M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74, 2006.
23. M.E.J. Newman. The structure and function of complex networks. SIAM Review, 45, 2003.
24. B. V. North, D. Curtis, and P. C. Sham. A note on the calculation of empirical P values from Monte Carlo procedures. The American Journal of Human Genetics, 71(2), 2002.
25. 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.
26. Satu Elisa Schaeffer. Graph clustering. Computer Science Review, 1(1), 2007.
27. Roded Sharan, Trey Ideker, Brian Kelley, Ron Shamir, and Richard M. Karp. Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. Journal of Computational Biology, 12(6), 2005.
28. A.J. Soper, C. Walshaw, and M. Cross. A combined evolutionary search and multilevel optimisation approach to graph-partitioning. Journal of Global Optimization, 29, 2004.
29. Yang Wang, Chakrabarti, Chenxi Wang, and Christos Faloutsos. Epidemic spreading in real networks: an eigenvalue viewpoint. In Proc. 22nd International Symposium on Reliable Distributed Systems, 2003.
30. Takashi Washio and Hiroshi Motoda. State of the art of graph-based data mining. ACM SICKDD Explorations Newsletter, 5(1), 2003.
31. D. J. Watts and S. H. Strogatz. Collective dynamics of small-world. Nature, 393, 1998.
32. Peter H. Westfall and S. Stanley Young. Resampling-based multiple testing: examples and methods for p-value adjustment. Wiley, 1993.
33. X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In Proc. of the 2008 SIAM International Conference on Data Mining, 2008.
34. Stella X. Yu and Jianbo Shi. Multiclass spectral clustering. In Proc. of the Ninth IEEE International Conference on Computer Vision (ICCV'03), 2003.
35. W. W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33, 1977.