Algorithms for mining the evolution of conserved relational states in dynamic networks

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 1-10

  Ahmed, Rezwan ^a   Karypis, George ^a  

^a University of Minnesota   (United States)

Author keywords

Dynamic network; Evolution; Relational state

Indexed keywords

COMPLEX ENTITIES; DATA MINING METHODS; DATA SETS; DYNAMIC ASPECTS; DYNAMIC NETWORK; EVOLUTION; EXTERNAL FACTORS; REAL-WORLD APPLICATION; RELATIONAL STATE; TEMPORAL CHANGE; TEMPORAL EVOLUTION;

DATA MINING;

EID: 84857151939     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2011.20     Document Type: Conference Paper

References (35)

1. M. J. Zaki, "Efficiently mining frequent trees in a forest," in ACM KDD, 2002, pp. 71-80.
2. T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, and S. Arikawa, "Efficient substructure discovery from large semi-structured data," in Proc. of the 2nd SIAM Symposium on Data Mining, 2002, pp. 158-74.
3. A. Inokuchi, T. Washio, and H. Motoda, "An apriori-based algorithm for mining frequent substructures from graph data," in Proc. of the 4th European Conf. on Principles of Data Mining and Knowledge Discovery. Springer-Verlag, 2000, pp. 13-23.
4. J. Huan, W. Wang, and J. Prins, "Efficient mining of frequent subgraph in the presence of isomorphism," in IEEE ICDM, 2003, pp. 549-552.
5. M. Kuramochi and G. Karypis, "An efficient algorithm for discovering frequent subgraphs," IEEE TKDE, vol. 16, no. 9, pp. 1038-1051, 2004.
6. - "Finding frequent patterns in a large sparse graph," Data Mining and Knowledge Discovery, vol. 11, no. 3, pp. 243-271, 2005.
7. G. Salton and M. J. McGill, Introduction to Modern Information Retrieval. McGraw-Hill, 1983.
8. J. Han, M. Kamber, and A. K. H. Tung, Spatial Clustering Methods in Data Mining: A Survey. Taylor and Francis, 2001.
9. M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis, "Frequent substructure-based approaches for classifying chemical compounds," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 8, pp. 1036-1050, 2005.
10. N. Wale, I. A. Watson, and G. Karypis, "Comparison of descriptor spaces for chemical compound retrieval and classification," Knowledge and Information Systems, vol. 14, no. 3, pp. 347-375, 2008.
11. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," Computer Networks and ISDN Systems, vol. 30, no. 1-7, pp. 107-117, 1998.
12. K. M. Borgwardt, H.-P. Kriegel, and P. Wackersreuther, "Pattern mining in frequent dynamic subgraphs," in IEEE ICDM, 2006, pp. 818-822.
13. D. Chakrabarti, R. Kumar, and A. Tomkins, "Evolutionary clustering," in ACM KDD, 2006, pp. 554-560.
14. M. Berlingerio, F. Bonchi, B. Bringmann, and A. Gionis, "Mining graph evolution rules," Machine Learning and Knowledge Discovery in Databases, pp. 115-130, 2009.
15. L. Cerf, T. Nguyen, and J. Boulicaut, "Discovering relevant cross-graph cliques in dynamic networks," Foundations of Intelligent Systems, pp. 513-522, 2009.
16. C. Robardet, "Constraint-based pattern mining in dynamic graphs," in IEEE ICDM, 2009, pp. 950-955.
17. A. Inokuchi and T. Washio, "Mining frequent graph sequence patterns induced by vertices," in Proc. of 10th SIAM Intl. Conf. on Data Mining, 2010, pp. 466-477.
18. D. B. West, Introduction to Graph Theory. Prentice Hall., 2001.
19. S. Kramer, L. De Raedt, and C. Helma, "Molecular feature mining in hiv data," in ACM KDD, 2001.
20. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu, "Prefixspan: Mining sequential patterns by prefix-projected growth," in ICDE, 2001, pp. 215-224. [Online]. Available: citeseer.nj.nec.com/pei01prefixspan.html
21. J. Huan, W. Wang, and J. Prins, "Efficient mining of frequent subgraph in the presence of isomophism," in IEEE ICDM, 2003.
22. H. Hu, X. Yan, H. Yu, J. Han, and X. Zhou, "Mining coherent dense subgraphs across massive biological networks for functional discovery," in ISMB, Ann Arbor, MI, 2005, pp. 213-221.
23. J. Pei, D. Jiang, and A. Zhang, "On mining cross-graph quasi-cliques," in ACM KDD, 2005, pp. 228-238.
24. X. Yan, X. J. Zhou, and J. Han, "Mining closed relational graphs with connectivity constraints," in ACM KDD, 2005, pp. 324-333.
25. P. Desikan and J. Srivastava, "Mining temporally evolving graphs," in WEBKDD Workshop, vol. 22. Citeseer, 2004.
26. B. Wackersreuther, P. Wackersreuther, A. Oswald, C. B "ohm, and K. Borgwardt, "Frequent subgraph discovery in dynamic networks," in Proc. of the 8th Workshop on Mining and Learning with Graphs. ACM, 2010, pp. 155-162.
27. R. Jin, S. McCallen, and E. Almaas, "Trend motif: A graph mining approach for analysis of dynamic complex networks," in IEEE ICDM, 2007, pp. 541-546.
28. A. Inokuchi and T. Washio, "A fast method to mine frequent subsequences from graph sequence data," in IEEE ICDM, 2008, pp. 303-312.
29. C. You, L. Holder, and D. Cook, "Learning patterns in the dynamics of biological networks," 2009.
30. M. Koyutiirk, Y. Kim, S. Subramaniam, W. Szpankowski, and A. Grama, "Detecting conserved interaction patterns in biological networks," Journal of Computational Biology, vol. 13, no. 7, pp. 1299-1322, 2006.
31. T. Berger-Wolf and J. Saia, "A framework for analysis of dynamic social networks," in ACM KDD, 2006, pp. 523-528.
32. M. Lahiri and T. Berger-Wolf, "Mining periodic behavior in dynamic social networks," in IEEE ICDM, 2008, pp. 373-382.
33. L. Tang, H. Liu, J. Zhang, and Z. Nazeri, "Community evolution in dynamic multi-mode networks," in ACM KDD, 2008, pp. 677-685.
34. K. S. Gleditsch, "Expanded Trade and GDP Data," Journal of Conflict Resolution, vol. 46, no. 5, pp. 712-724, 2002.
35. W. W. Cohen, "Enron email dataset," Website, 2005, http://www.cs.cmu.edu/ enron/.