A Significant Improvement of Softassign with Diffusion Kernels

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3138, Issue , 2004, Pages 76-84

  Lozano, Miguel Angel ^a   Escolano, Francisco ^a  

^a UNIVERSITY OF ALICANTE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COST FUNCTIONS; PATTERN MATCHING; PATTERN RECOGNITION; PROBABILITY DISTRIBUTIONS;

DIFFUSION KERNEL; GRAPH-MATCHING ALGORITHMS; MATCHING PERFORMANCE; MATCHING PROBLEMS; QUADRATIC COST FUNCTIONS; SPECTRAL GRAPH THEORY; UNWEIGHTED GRAPHS; USE DIFFUSIONS;

GRAPH THEORY;

EID: 35048903157     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27868-9_7     Document Type: Article

References (15)

1. Chung, F.R.K.: Spectral Graph Theory. Conference Board of the Mathematical Sciences (CBMS) 92. American Mathematical Society (1997)
2. Cristianini, N Shawe-Taylor, J.: An Introduction to Support Vector Machines Cambridge University Press (2000)
3. Gärtner: A Survey of Kernels for Structured Data. ACM SIGKDD Explorations Newsletter 5(1) (2003) 49-58
4. Gold, S Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 18 (4) (1996) 377-388
5. Finch, A.M Wilson, R.C Hancock, E.: An Energy Function and Continuous Edit Process for Graph Matching. Neural Computation, 10 (7) (1998) 1873-1894
6. Kondor, R.I Lafferty, J.: Diffusion Kernels on Graphs and other Discrete Input Spaces. In: Sammut, C and Hoffmann, A. G. (eds) Machine Learning, Proceedings of the Nineteenth International Conference (ICML 2002). Morgan Kaufmann (2002) 315-322
7. Müller, K.-R Mika, S Räshc, Tsuda, K Schölkopf, B.: An Introduction to Kernel-based Learning Algorithms. IEEE Transactions on Neural Networks, 12(2) (2001) 181-201.
8. Pelillo, M.: Replicator Equations, Maximal Cliques, and Graph Isomorphism. Neural Computation 11 (1999) 1933-1955
9. Robles-Kelly, A Hancock, E.: Graph Matching Using Spectral Sedation. In: Rangaraja, A Figueiredo, M and Zerubia, J. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition, Proceedings of the 4th International Workshop, EMMCVPR 2003. Lecture Notes in Computer Science. Springer. Vol 2683 (2003) 517-532
10. R. Sinkhorn.: A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices. Annals of Mathematical Statistics 35 (1964) 876-879
11. Schmidt, D.C Druffel, L.E.: A Fast Backtracking Algorithm to Test Direct Graphs for Isomorphism Using Distance Matrices. Journal of the ACM 23 (3) (1976) 433-445
12. Schölkopf, B Smola, A.: Learning with Kernels. MIT Press (2002).
13. Smola, A Kondor, R.I.: Kernels and Regularization on Graphs. In: Schölkopf.B and Warmuth, M. K. (eds) Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003. Lecture Notes in Computer Science. Springer. Vol. 2777 (2003) 144-158
14. DePiero, F.W Trivedi, M Serbin, S.: Graph Matching Using a Direct Classification of Node Attendance. Pattern Recognition, Vol. 29(6) (1996) 1031-1048
15. Ozer, B Wolf, W Akansu, A.N.: A Graph Based Object Description for Information Retrieval in Digital Image and Video Libraries. In: Proceedings of the IEEE Workshop on Content-Based Access of Image and Video Libraries (1999) 79-83