ASM Kernel: Graph Kernel using Approximate Subgraph Matching for Relation Extraction
Code (0)
등록된 구현이 없습니다.
Tasks
Feature EngineeringGeneral ClassificationRelationRelation ExtractionSentence ClassificationSimilar Papers 제목 키워드 기반
Subgraph Matching Kernels for Attributed Graphs
We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in ge…
General ClassificationA Unifying View of Explicit and Implicit Feature Maps of Graph Kernels
Non-linear kernel methods can be approximated by fast linear ones using suitable explicit feature maps allowing their application to large scale problems. We investigate how convolution kernels for structured data are co…
DiversityTowards Subgraph Isomorphism Counting with Graph Kernels
Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and …
Graph ClassificationRepresentation LearningThe Multiscale Laplacian Graph Kernel
Many real world graphs, such as the graphs of molecules, exhibit structure at multiple different scales, but most existing kernels between graphs are either purely local or purely global in character. In contrast, by bui…
Graph ClassificationGraph Invariant Kernels
We introduce a novel kernel that upgrades the Weisfeiler-Lehman and other graph kernels to effectively exploit high-dimensional and continuous vertex attributes. Graphs are first decomposed into subgraphs. Vertices of th…
Graph Classification