Author:
Gärtner Thomas,Horváth Tamás,Wrobel Stefan
Reference11 articles.
1. Borgwardt KM, Petri T, Vishwanathan SVN, Kriegel H-P (2007) An efficient sampling scheme for comparison of large graphs. In: Mining and learning with graphs (MLG 2007), Firenze
2. Collins M, Duffy N (2002) Convolution kernel for natural language. In: Advances in neural information processing systems (NIPS), Vancouver, vol 16, pp 625–632
3. Deshpande M, Kuramochi M, Karypis G (2002) Automated approaches for classifying structures. In: Proceedings of the 2nd ACM SIGKDD workshop on data mining in bioinformatics (BIO KDD 2002), Edmonton
4. Gärtner T (2005) Predictive graph mining with kernel methods. In: Bandyopadhyay S, Maulik U, Holder LB, Cook DJ (eds) Advanced methods for knowledge discovery from complex data. Springer, Heidelberg, pp 95–121
5. Gärtner T, Flach PA, Wrobel S (2003) On graph kernels: hardness results and efficient alternatives. In: Proceedings of the 16th annual conference on computational learning theory and the 7th kernel workshop (COLT 2003), vol. 2777 of LNCS. Springer, Heidelberg, pp 129–143
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Truss-Based Framework for Graph Similarity Computation;Journal of Database Management;2023-04-21
2. A Representation Learning Framework for Property Graphs;Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining;2019-07-25