메뉴 건너뛰기




Volumn 7523 LNAI, Issue PART 1, 2012, Pages 378-393

Efficient graph kernels by randomization

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DATASETS; COMPLEX DATA; DISCRETE NODES; GRAPH FEATURES; GRAPH KERNELS; LABEL DISTRIBUTION; LABEL INFORMATION; LABEL PROPAGATION; LABELED GRAPHS; LOCALITY SENSITIVE HASHING; NODE ATTRIBUTE; ORDERS OF MAGNITUDE; RUNTIMES; SIMILARITY MEASURE; STRUCTURED DATA; VECTOR VALUED;

EID: 84866859138     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33460-3_30     Document Type: Conference Paper
Times cited : (55)

References (25)
  • 4
    • 9444266406 scopus 로고    scopus 로고
    • On Graph Kernels: Hardness Results and Efficient Alternatives
    • Schölkopf, B.,Warmuth, M.K. (eds.) COLT/Kernel 2003. Springer, Heidelberg
    • Gärtner, T., Flach, P.A., Wrobel, S.: On Graph Kernels: Hardness Results and Efficient Alternatives. In: Schölkopf, B.,Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol. 2777, pp. 129-143. Springer, Heidelberg (2003)
    • (2003) LNCS (LNAI) , vol.2777 , pp. 129-143
    • Gärtner, T.1    Flach, P.A.2    Wrobel, S.3
  • 13
    • 60949112299 scopus 로고    scopus 로고
    • Graph kernels based on tree patterns for molecules
    • Mahé, P., Vert, J.-P.: Graph kernels based on tree patterns for molecules. Machine Learning 75(1), 3-35 (2009)
    • (2009) Machine Learning , vol.75 , Issue.1 , pp. 3-35
    • Mahé, P.1    Vert, J.-P.2
  • 17


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