Author:
Riesen Kaspar,Jiang Xiaoyi,Bunke Horst
Reference101 articles.
1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.
2. R. Ambauen, S. Fischer, and H. Bunke. Graph edit distance with node splitting and merging and its application to diatom identification. In E. Hancock and M. Vento, editors, Proc. 4th Int. Workshop on Graph Based Representations in Pattern Recognition, LNCS 2726, pages 95–106. Springer, 2003.
3. J.C. Bezdek and L. Kuncheva. Nearest prototype classifier designs: An experimental study. Int. Journal of Intelligent Systems, 16(12):1445–1473, 2001.
4. C. Bishop. Pattern Recognition and Machine Learning. Springer, 2008.
5. K. Borgwardt, C. Ong, S. Schonauer, S. Vishwanathan, A. Smola, and H.-P. Kriegel. Protein function prediction via graph kernels. Bioinformatics, 21(1):47–56, 2005.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献