Statistical and Machine Learning Approaches for Network Analysis

References

1. E. Georgii, S. Dietmann, T. Uno, P. Pagel, K. Tsuda, Enumeration of condition-dependent dense modules in protein interaction networks. Bioinformatics 25(7), 933–940 (2009).

2. E.A. Akkoyunlu, The enumeration of maximal cliques of large graphs. SIAM J. Comput. 2(1), 1–6 (1973).

3. E. Georgii, K. Tsuda, B. Schölkopf, Multi-way set enumeration in real-valued tensors, in DMMT ’09: Proceedings of the 2nd Workshop on Data Mining using Matrices and Tensors, ACM, pp. 32–41 (Article No. 4), 2009.

4. E. Georgii, K. Tsuda, B. Schölkopf, Multi-way set enumeration in weight tensors. Mach. Learn. 82, 123–155 (2011).

5. X. Yan, J. Han, gSpan: graph-based substructure pattern mining, in ICDM ’02: Proceedings of the 2nd IEEE International Conference on Data Mining, IEEE Computer Society, pp. 721–724, 2002.

6. M. Kuramochi, G. Karypis, An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowl. Data Eng. 16(9), 1038–1051 (2004).

7. S. Kramer, L. De Raedt, C. Helma, Molecular feature mining in HIV data, in KDD ’01: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp. 136–143, 2001.

8. H. Hu, X. Yan, Y. Huang, J. Han, X.J. Zhou, Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics 21(Suppl. 1), i213–i221 (2005).

9. X. Yan, X.J. Zhou, J. Han, Mining closed relational graphs with connectivity constraints, in KDD ’05: Proceedings of the 11th ACM SIGKDD International ...