https://doi.org/
Poster
NOT PEER REVIEWED
Download
metrics
VIEWS
133
 
downloads
430
CITE
How to cite this poster:
Shervashidze N, Smola A and Borgwardt K Scalable graph kernels with approximate matching of subtree patterns. F1000Posters 2010, 1:320 (poster)

Scalable graph kernels with approximate matching of subtree patterns

Nino Shervashidze1, Alex Smola, Karsten Borgwardt
Published 02 Aug 2010
Author Affiliations
  • Metrics
  • 133 Views
  • 430 Downloads
 
Part of the following:
Browse by related subjects
Published 02 Aug 2010

Scalable graph kernels with approximate matching of subtree patterns

[version 1; not peer reviewed]

Nino Shervashidze1, Alex Smola, Karsten Borgwardt
Author Affiliations
1 Machine Learning and Computational Biology Research Group, MPIs, Germany
Presented at
Intelligent Systems for Molecular Biology 2010 meeting
Abstract
Competing Interests

No relevant conflicts of interest declared.

Comments
0 Comments
 
Sign In
If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password.

The email address should be the one you originally registered with F1000.

Email address not valid, please try again

You registered with F1000 via Google, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Google account password, please click here.

You registered with F1000 via Facebook, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Facebook account password, please click here.

Code not correct, please try again
Email us for further assistance.
Server error, please try again.