Inferring a graph from path frequency

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 371-382

  Akutsu, Tatsuya ^a   Fukagawa, Daiji ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE RECONSTRUCTION; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

MACHINE LEARNING; NP-HARD; PLANAR GRAPHS; PRE-IMAGE PROBLEM;

GRAPH THEORY;

EID: 26444551152     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_32     Document Type: Conference Paper

References (17)

1. Asano, T.: An O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees. J. Computer and System Sciences 51 (1995) 503-510
2. Bakir, G.H., Weston, J., Schölkopf, B.: Learning to find pre-images. Advances in Neural Information Processing Systems 16 (2004) 449-456
3. Bakir, G.H., Zien, A., Tsuda, K.: Learning to find graph pre-images. In Proc. the 26th DAGM Symposium. Volume 3175 of Lecture Notes in Computer Science, Springer (2004) 253-261
4. Cortes, C., Vapnik, V.: Support vector networks. Machine Learning 20 (1995) 273-297
5. Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge Univ. Press (2000)
6. Dinitz, Y., Itai, A., Rodeh, M.: On an algorithm of Zemlyachenko for subtree isomorphism. Information Processing Letters 70 (1999) 141-146
7. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Co. (1979)
8. Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In Proc. 20th Int. Conf. Machine Learning (2003) 321-328
9. Lauri, J., Scapellato, R.: Topics in Graph Automorphisms and Reconstruction. Cambridge Univ. Press (2003)
10. Leslie, C., Eskin, E., Noble, W.S.: The spectrum kernel: a string kernel for SVM protein classification. In Proc. Pacific Symposium on Biocomputing 7 (2002) 564-575
11. Mahé, P., Ueda, N., Akutsu, T., Perret, J-L., Vert, J-P.: Extensions of marginalized graph kernels. In Proc. 21st Int. Conf. Machine Learning (2004) 552-559
12. Maruyama, O., Miyano, S.: Inferring a tree from walks. Theoretical Computer Science 161 (1996) 289-300
13. Nachbar, R.B.: Molecular evolution: automated manipulation of hierarchical chemical topology and its application to average molecular structures. Genetic Programming and Evolvable Machines 1 (2000) 57-94
14. Pevzner, P.A.: Computational Molecular Biology. An Algorithmic Approach. The MIT Press (2000)
15. Raghavan, V.: Bounded degree graph inference from walks. J. Computer and System Sciences 49 (1994) 108-132
16. Schölkopf, B., Tsuda, K., Vert, J-P. (eds.): Kernel Methods in Computational Biology. The MIT Press (2004)
17. Vinkers, H.M., de Jonge, M.R., Daeyaert, F.F.D., Heeres, J., Koymans, L.M.H., van Lenthe, J.H., Lewi, P.J., Timmerman, H., van Aken, K., Janssen, P.A.J.: Synopsis: synthesize and optimize system in silico. Journal of Medical Chemistry 46 (2003) 2765-2773