메뉴 건너뛰기




Volumn 1, Issue , 2012, Pages 269-272

Inexact graph matching through graph coverage

Author keywords

Graph classification system; Graph kernels; Inexact graph matching; Tensor product

Indexed keywords

ADJACENCY MATRICES; AVERAGE SIZE; CLASSIFICATION SYSTEM; COMPUTING TIME; DISSIMILARITY MEASURES; GRAPH CLASSIFICATION; GRAPH KERNELS; INEXACT GRAPH MATCHING; INPUT GRAPHS; PERFORMANCE EVALUATION; PRODUCT GRAPH; RANDOM SAMPLE; TENSOR PRODUCTS; UNSUPERVISED DATA;

EID: 84862233628     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (9)

References (10)
  • 4
    • 70349839347 scopus 로고    scopus 로고
    • Kernels for structured data. Number v. 72 in kernels for structured data
    • Gärtner, T. (2008). Kernels for structured data. Number v. 72 in Kernels For Structured Data. World Scientific.
    • (2008) World Scientific
    • Gärtner, T.1
  • 8
    • 64849091214 scopus 로고    scopus 로고
    • Approximate graph edit distance computation by means of bipartite graph matching
    • Riesen, K. and Bunke, H. (2009). Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput., 27:950-959.
    • (2009) Image Vision Comput. , vol.27 , pp. 950-959
    • Riesen, K.1    Bunke, H.2
  • 10
    • 0004094721 scopus 로고    scopus 로고
    • Learning with kernels: Support vector machines, regularization, optimization, and beyond
    • MIT Press
    • Schölkopf, B. and Smola, A. (2002). Learning with kernels: support vector machines, regularization, optimization, and beyond. Adaptive computation and machine learning. MIT Press.
    • (2002) Adaptive Computation and Machine Learning
    • Schölkopf, B.1    Smola, A.2


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