메뉴 건너뛰기




Volumn 4109 LNCS, Issue , 2006, Pages 191-199

A random walk kernel derived from graph edit distance

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; ERROR ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; LEARNING SYSTEMS;

EID: 33749611030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11815921_20     Document Type: Conference Paper
Times cited : (25)

References (12)
  • 3
    • 0002531715 scopus 로고    scopus 로고
    • Dynamic alignment kernels
    • Smola, A., Bartlett, P., Schölkopf, B., Schuurmans, D., eds.: MIT Press
    • Watkins, C.: Dynamic alignment kernels. In Smola, A., Bartlett, P., Schölkopf, B., Schuurmans, D., eds.: Advances in Large Margin Classifiers. MIT Press (2000) 39-50
    • (2000) Advances in Large Margin Classifiers , pp. 39-50
    • Watkins, C.1
  • 4
    • 0004019973 scopus 로고    scopus 로고
    • Convolution kernels on discrete structures
    • University of California, Santa Cruz
    • Haussler, D.: Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, University of California, Santa Cruz (1999)
    • (1999) Technical Report , vol.UCSC-CRL-99-10
    • Haussler, D.1
  • 5
    • 15844372451 scopus 로고    scopus 로고
    • SVM learning with the Schur-Hadamard inner product for graphs
    • Jain, B., Geibel, P., Wysotzki, F.: SVM learning with the Schur-Hadamard inner product for graphs. Neurocomputing 64 (2005) 93-105
    • (2005) Neurocomputing , vol.64 , pp. 93-105
    • Jain, B.1    Geibel, P.2    Wysotzki, F.3
  • 6
    • 9444266406 scopus 로고    scopus 로고
    • On graph kernels: Hardness results and efficient alternatives
    • Schölkopf, B., Warmuth, M., eds.
    • Gärtner, T., Flach, P., Wrobel, S.: On graph kernels: Hardness results and efficient alternatives. In Schölkopf, B., Warmuth, M., eds.: Proc. of the 16th Annual Conf. on Learning Theory. (2003) 129-143
    • (2003) Proc. of the 16th Annual Conf. on Learning Theory , pp. 129-143
    • Gärtner, T.1    Flach, P.2    Wrobel, S.3
  • 9
    • 0021022807 scopus 로고
    • Inexact graph matching for structural pattern recognition
    • Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1 (1983) 245-253
    • (1983) Pattern Recognition Letters , vol.1 , pp. 245-253
    • Bunke, H.1    Allermann, G.2
  • 10
    • 24644458373 scopus 로고    scopus 로고
    • An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification
    • Proc. 10th Int. Workshop on Structural and Syntactic Pattern Recognition. Springer
    • Neuhaus, M., Bunke, H.: An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification. In: Proc. 10th Int. Workshop on Structural and Syntactic Pattern Recognition. LNCS 3138, Springer (2004) 180-189
    • (2004) LNCS , vol.3138 , pp. 180-189
    • Neuhaus, M.1    Bunke, H.2
  • 11
    • 25144445748 scopus 로고    scopus 로고
    • Feature selection for graph-based image classifiers
    • Proc. 2nd Iberian Conf. on Pattern Recognition and Image Analysis Springer
    • Le Saux, B., Bunke, H.: Feature selection for graph-based image classifiers. In: Proc. 2nd Iberian Conf. on Pattern Recognition and Image Analysis. LNCS 3523, Springer (2005) 147-154
    • (2005) LNCS , vol.3523 , pp. 147-154
    • Le Saux, B.1    Bunke, H.2
  • 12
    • 35248891629 scopus 로고    scopus 로고
    • Graph edit distance with node splitting and merging and its application to diatom identification
    • Hancock, E., Vento, M., eds.: Proc. 4th Int. Workshop on Graph Based Representations in Pattern Recognition. Springer
    • Ambauen, R., Fischer, S., Bunke, H.: Graph edit distance with node splitting and merging and its application to diatom identification. In Hancock, E., Vento, M., eds.: Proc. 4th Int. Workshop on Graph Based Representations in Pattern Recognition. LNCS 2726, Springer (2003) 95-106
    • (2003) LNCS , vol.2726 , pp. 95-106
    • Ambauen, R.1    Fischer, S.2    Bunke, H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.