 | Up a level |
Neuhaus, Michel; Riesen, Kaspar; Bunke, Horst (2009). Novel kernels for error-tolerant graph classification. Spatial vision, 22(5), pp. 425-441. Leiden: Brill 10.1163/156856809789476119
Neuhaus, Michel; Bunke, Horst (2007). Automatic learning of cost functions for graph edit distance. Information sciences, 177(1), pp. 239-247. New York, N.Y.: Elsevier Science 10.1016/j.ins.2006.02.013
Neuhaus, Michel; Bunke, Horst (2006). Edit distance based kernel functions for structural pattern classification. Pattern recognition, 39(10), pp. 1852-1863. Oxford: Pergamon 10.1016/j.patcog.2006.04.012
Bunke, Horst; Neuhaus, Michel (2007). Graph matching - Exact and error-tolerant methods and the automatic learning of edit costs. In: Cook, Diane J.; Holder, Lawrence B. (eds.) Mining Graph Data (pp. 17-34). Chichester: John Wiley & Sons
Neuhaus, Michel; Bunke, Horst (2007). Bridging the Gap between Graph Edit Distance and Kernel Machines. Singapore: World Scientific Publishing
Neuhaus, Michel; Bunke, Horst (2007). A quadratic programming approach to the graph edit distance problem. In: Graph-Based Representations in Pattern Recognition. 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007. Proceedings. Lecture Notes in Computer Science: Vol. 4538 (pp. 92-102). Heidelberg: Springer Verlag 10.1007/978-3-540-72903-7_9
Riesen, Kaspar; Neuhaus, Michel; Bunke, Horst (2007). Graph embedding in vector spaces by means of prototype selection. In: Graph-Based Representations in Pattern Recognition. 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007. Proceedings. Lecture Notes in Computer Science: Vol. 4538 (pp. 383-393). Heidelberg: Springer Verlag 10.1007/978-3-540-72903-7_35
Riesen, Kaspar; Neuhaus, Michel; Bunke, Horst (2007). Bipartite graph matching for computing the edit distance of graphs. In: Graph-Based Representations in Pattern Recognition. 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007. Proceedings. Lecture Notes in Computer Science: Vol. 4538 (pp. 1-12). Heidelberg: Springer Verlag 10.1007/978-3-540-72903-7_1
Neuhaus, Michel; Bunke, Horst (2006). A Random Walk Kernel Derived from Graph Edit Distance. In: Structural, Syntactic, and Statistical Pattern Recognition. Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, 2006. Proceedings. Lecture Notes in Computer Science: Vol. 4109 (pp. 191-199). Heidelberg: Springer Verlag 10.1007/11815921_20
Neuhaus, Michel; Riesen, Kaspar; Bunke, Horst (2006). Fast suboptimal algorithms for the computation of graph edit distance. In: Structural, Syntactic, and Statistical Pattern Recognition. Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, 2006. Proceedings. Lecture Notes in Computer Science: Vol. 4109 (pp. 163-172). Heidelberg: Springer Verlag 10.1007/11815921_17
Spillmann, Barbara; Neuhaus, Michel; Bunke, Horst; Pekalska, Elzbieta; Duin, Robert (2006). Transforming strings to vector spaces using prototype selection. In: Structural, Syntactic, and Statistical Pattern Recognition. Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, 2006. Proceedings. Lecture Notes in Computer Science: Vol. 4109 (pp. 287-296). Heidelberg: Springer Verlag 10.1007/11815921_31
Spillmann, Barbara; Neuhaus, Michel; Bunke, Horst (2006). Multiple classifier systems for embedded string patterns. In: Artificial Neural Networks in Pattern Recognition. Second IAPR Workshop, ANNPR 2006. Proceedings. Lecture Notes in Computer Science: Vol. 4087 (pp. 177-187). Heidelberg: Springer Verlag 10.1007/11829898_16
Neuhaus, Michel; Bunke, Horst (2006). A Convolution Edit Kernel for Error-tolerant Graph Matching. In: 18th International Conference on Pattern Recognition (ICPR'06), 20-24 August 2006, Hong Kong, China, Volume 4 (pp. 220-223). Washington, DC: IEEE Computer Society
