Edit distance-based kernel functions for structural pattern classification

Pattern Recognition

Volumn 39, Issue 10, 2006, Pages 1852-1863

  Neuhaus, Michel ^a   Bunke, Horst ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Edit distance; Graph matching; Kernel methods; String matching; Support vector machine

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); DATABASE SYSTEMS; GRAPH THEORY; VECTORS;

EDIT DISTANCE; GRAPH MATCHING; KERNEL METHODS; STRING MATCHING; SUPPORT VECTOR MACHINES;

PATTERN RECOGNITION;

EID: 33745360257     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2006.04.012     Document Type: Article

References (48)

1. Special Issue on Graph Based Representations, Pattern Recognition Lett. 24(8) (2003) 1033-1122.
2. Special Section on Graph Algorithms and Computer Vision, IEEE Trans. Pattern Anal. Mach. Intell. 23(10) (2001) 1040-1151.
3. Special Issue on Graph Matching in Pattern Recognition and Machine Vision, Int. J. Pattern Recognition Artif. Intell. 18(3) (2004) 261-517.
4. Levi G. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9 (1972) 341-354
5. McGregor J. Backtrack search algorithm and the maximal common subgraph problem. Software Pract. Exper. 12 1 (1982) 23-34
6. Hunt J., and Szymanski T. A fast algorithm for computing longest common subsequences. Commun. ACM 20 5 (1977) 350-353
7. Wagner R., and Fischer M. The string-to-string correction problem. J. Assoc. Comput. Mach. 21 1 (1974) 168-173
8. Sanfeliu A., and Fu K. A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13 3 (1983) 353-363
9. Messmer B., and Bunke H. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Anal. Mach. Intell. 20 5 (1998) 493-504
10. Shawe-Taylor J., and Cristianini N. Kernel Methods for Pattern Analysis (2004), Cambridge University Press, Cambridge
11. Byun H., and Lee S. A survey on pattern recognition applications of support vector machines. Int. J. Pattern Recognition Artif. Intell. 17 3 (2003) 459-486
12. Müller K., Mika S., Rätsch G., Tsuda K., and Schölkopf B. An introduction to kernel-based learning algorithms. IEEE Trans. Neural Networks 12 2 (2001) 181-202
13. Vapnik V. Statistical Learning Theory (1998), Wiley, New York
14. Schölkopf B., and Smola A. Learning with Kernels (2002), MIT Press, Cambridge, MA
15. Joachims T. Learning to Classify Text Using Support Vector Machines (2002), Kluwer Academic Publisher, Dordrecht
16. Watkins C. Dynamic alignment kernels. In: Smola A., Bartlett P., Schölkopf B., and Schuurmans D. (Eds). Advances in Large Margin Classifiers (2000), MIT Press, Cambridge, MA 39-50
17. Lodhi H., Saunders C., Shawe-Taylor J., Cristianini N., and Watkins C. Text classification using string kernels. J. Mach. Learn. Res. 2 (2002) 419-444
18. Kashima H., Tsuda K., and Inokuchi A. Marginalized kernels between labeled graphs. Proceedings of the 20th International Conference on Machine Learning (2003) 321-328
19. Gärtner T. A survey of kernels for structured data. ACM SIGKDD Explor. 5 1 (2003) 49-58
20. Jain B., Geibel P., and Wysotzki F. SVM learning with the Schur-Hadamard inner product for graphs. Neurocomputing 64 (2005) 93-105
21. M. Neuhaus, H. Bunke, Edit distance based kernel functions for attributed graph matching, in: L. Brun, M. Vento (Eds.), Proceedings of the Fifth International Workshop on Graph-Based Representations in Pattern Recognition, Lecture Notes in Computer Science, vol. 3434, Springer, Berlin, 2005, pp. 352-361.
22. Christmas W., Kittler J., and Petrou M. Structural matching in computer vision using probabilistic relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 17 8 (1995) 749-764
23. Wilson R., and Hancock E. Structural matching by discrete relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 19 6 (1997) 634-648
24. Pelillo M., Siddiqi K., and Zucker S. Matching hierarchical structures using association graphs. IEEE Trans. Pattern Anal. Mach. Intell. 21 11 (1999) 1105-1120
25. Luo B., and Hancock E. Structural graph matching using the EM algorithm and singular value decomposition. IEEE Trans. Pattern Anal. Mach. Intell. 23 10 (2001) 1120-1136
26. Seni G., Kripásundar V., and Srihari R. Generalizing edit distance to incorporate domain information: handwritten text recognition as a case study. Pattern Recognition 29 3 (1996) 405-414
27. Bunke H., and Bühler U. Applications of approximate string matching to 2D shape recognition. Pattern Recognition 26 12 (1993) 1797-1812
28. Jain A., Hong L., and Bolle R. On-line fingerprint verification. IEEE Trans. Pattern Anal. Mach. Intell. 19 4 (1997) 302-314
29. M. Neuhaus, H. Bunke, An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification, in: Proceedings of the 10th International Workshop on Structural and Syntactic Pattern Recognition, Lecture Notes in Computer Science, vol. 3138, Springer, Berlin, 2004, pp. 180-189.
30. Cover T. Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition. IEEE Trans. Electron. Comput. 14 (1965) 326-334
31. Berg C., Christensen J., and Ressel P. Harmonic Analysis on Semigroups (1984), Springer, Berlin
32. Mika S., Rätsch G., Weston J., Schölkopf B., and Müller K. Fisher discriminant analysis with kernels. Proceedings of the IEEE Workshop on Neural Networks for Signal Processing (1999) 41-48
33. D. Haussler, Convolutional kernels on discrete structures, Technical Report UCSC-CRL-99-10, University of California, Santa Cruz, 1999.
34. Kondor R., and Lafferty J. Diffusion kernels on graphs and other discrete input spaces. Proceedings of the 19th International Conference on Machine Learning (2002) 315-322
35. Haasdonk B. Feature space interpretation of SVMs with indefinite kernels. IEEE Trans. Pattern Anal. Mach. Intell. 27 4 (2005) 482-492
36. Gill P., Murray W., and Wright M. Practical Optimization (1981), Academic Press, New York
37. Andreu G., Crespo A., and Valiente J. Selecting the toroidal self-organizing feature maps (TSOFM) best organized to object recognition. Proceedings of the IEEE International Conference on Neural Networks vol. 2 (1997) 1341-1346
38. Peris G., and Marzal A. Fast cyclic edit distance computation with weighted edit costs in classification. Proceedings of the 16th International Conference on Pattern Recognition vol. 4 (2002) 184-187
39. Siddiqi K., Shokoufandeh A., Dickinson S., and Zucker S. Shock graphs and shape matching. Int. J. Comput. Vision 30 (1999) 1-24
40. E. Alpaydin, F. Alimoglu, Pen-based recognition of handwritten digits, Department of Computer Engineering, Bogazici University, 1998.
41. Lundsteen C., Phillip J., and Granum E. Quantitative analysis of 6985 digitized trypsin G-banded human metaphase chromosomes. Clin. Genet. 18 (1980) 355-370
42. Günter S., and Bunke H. Self-organizing map for clustering in the graph domain. Pattern Recognition Lett. 23 4 (2002) 405-417
43. H. du Buf, M. Bayer (Eds.), Automatic Diatom Identification, World Scientific, Singapore, 2002.
44. R. Ambauen, S. Fischer, H. Bunke, Graph edit distance with node splitting and merging and its application to diatom identification, in: Proceedings of the 4th International Workshop on Graph Based Representations in Pattern Recognition, Lecture Notes in Computer Science, vol. 2726, 2003, pp. 95-106.
45. Maltoni D., Maio D., Jain A., and Prabhakar S. Handbook of Fingerprint Recognition (2003), Springer, Berlin
46. C. Watson, C. Wilson, NIST Special Database 4. Fingerprint Database, National Institute of Standards and Technology, 1992.
47. C. Chang, C. Lin, LIBSVM: A Library for Support Vector Machines, software available at 〈http://www.csie.ntu.edu.tw/∼cjlin/libsvm〉, 2001.
48. Torsello A., and Hancock E. Computing approximate tree edit distance using relaxation labeling. Pattern Recognition Lett. 24 8 (2003) 1089-1097