The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Deep Graph Kernels
Abstract
In this paper, we present Deep Graph Kernels, a unified framework to learn latent representations of sub-structures for graphs, inspired by latest advancements in language modeling and deep learning. Our framework leverages the dependency information between sub-structures by learning their latent representations. We demonstrate instances of our framework on three popular graph kernels, namely Graphlet kernels, Weisfeiler-Lehman subtree kernels, and Shortest-Path graph kernels. Our experiments on several benchmark datasets show that Deep Graph Kernels achieve significant improvements in classification accuracy over state-of-the-art graph kernels.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
Libsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
Neural Information Processing Systems
(2018) · The Deep Learning Revolution · doi:10.7551/mitpress/11474.003.0014 · Cited by 3,730
Software Framework for Topic Modelling with Large Corpora
Rek, R. R. U., & Sojka, P. (2010) · doi:10.13140/2.1.2393.1847 · Cited by 3,647
A neural probabilistic language model
BengioYoshua, DucharmeRéjean, VincentPascal, & JanvinChristian (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944966 · Cited by 2,644
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Neural Word Embedding as Implicit Matrix Factorization
Levy, O., & Goldberg, Y. (2014) · neural information processing systems · Cited by 1,582
KERNEL METHODS IN MACHINE LEARNING
Hofmann, T., Schölkopf, B., & Smola, A. J. (2008) · Cited by 1,408
Protein function prediction via graph kernels
Borgwardt, K. M., Ong, C. S., Schonauer, S., Vishwanathan, S. V. N., Smola, A. J., & Kriegel, H.-P. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1007 · Cited by 1,105
Self-citationConvolution kernels on discrete structures
Haussler, D. H. (1999) · Cited by 1,089
THE SPECTRUM KERNEL: A STRING KERNEL FOR SVM PROTEIN CLASSIFICATION
LESLIE, C., ESKIN, E., & NOBLE, W. S. (2001) · Biocomputing 2002 · doi:10.1142/9789812799623_0053 · Cited by 927
SCOP database in 2004: refinements integrate structure and sequence family data
Andreeva, A. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh039 · Cited by 909
On Graph Kernels: Hardness Results and Efficient Alternatives
Gärtner, T., Flach, P., & Wrobel, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_11 · Cited by 879
Debnath, A. K., Lopez de Compadre, R. L., Debnath, G., Shusterman, A. J., & Hansch, C. (1991) · Journal of Medicinal Chemistry · doi:10.1021/jm00106a046 · Cited by 868
Vishwanathan, S. V. N., Schraudolph, N. N., Kondor, R., & Borgwardt, K. M. (2010) · CaltechAUTHORS (California Institute of Technology) · Cited by 850
Self-citationKernels and Regularization on Graphs
Smola, A. J., & Kondor, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_12 · Cited by 841
Biological network comparison using graphlet degree distribution
Pržulj, N. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl301 · Cited by 837
Shortest-Path Kernels on Graphs
Borgwardt, K. M., & Kriegel, H. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.132 · Cited by 837
Fox, N. K., Brenner, S. E., & Chandonia, J.-M. (2014) · Nucleic Acids Research · doi:10.1093/nar/gkt1240 · Cited by 762
Marginalized kernels between labeled graphs
Kashima, H., Tsuda, K., & Inokuchi, A. (2003) · Cited by 710
Efficient Graphlet Kernels for Large Graph Comparison
Sherashidze, N., Vishwanathan, S. V. N., Petri, T., Mehlhorn, K., & Borgwardt, K. M. (2009) · MPG.PuRe (Max Planck Society) · Cited by 644
Self-citationComparison of descriptor spaces for chemical compound retrieval and classification
Wale, N., Watson, I. A., & Karypis, G. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0103-5 · Cited by 453
Cyclic pattern kernels for predictive graph mining
Horváth, T., Gärtner, T., & Wrobel, S. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014072 · Cited by 308
Expressivity versus efficiency of graph kernels
Ramon, J., & Gaertner, T. (2003) · Lirias · Cited by 243
Comparison of Descriptor Spaces for Chemical Compound Retrieval and Classification
Wale, N., & Karypis, G. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.39 · Cited by 226
Fast subtree kernels on graphs
Shervashidze, N., & Borgwardt, K. M. (2009) · Cited by 217
Statistical evaluation of the Predictive Toxicology Challenge 2000–2001
Toivonen, H., Srinivasan, A., King, R. D., Kramer, S., & Helma, C. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg130 · Cited by 196
Fast Neighborhood Subgraph Pairwise Distance Kernel
Costa, F., & Grave, K. D. (2010) · Lirias · Cited by 167
Cited by
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
Cai, H., Zheng, V. W., & Chang, K. C.-C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807452 · Cited by 2,034
Cui, P., Wang, X., Pei, J., & Zhu, W. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2849727 · Cited by 1,274
Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs
Simonovsky, M., & Komodakis, N. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.11 · Cited by 1,266
Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks
Morris, C., Ritzert, M., Fey, M., Hamilton, W. L., Lenssen, J. E., Rattan, G., & Grohe, M. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33014602 · Cited by 1,210
Simplifying Graph Convolutional Networks
Wu, F., Zhang, T., Junior, A. H. D. S., Fifty, C., Yu, T., & Weinberger, K. Q. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.07153 · Cited by 1,165
Metadata
- Authors
- Yanardag, P., & Vishwanathan, S. V. N.
- Venue
- Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
- Publisher
- ACM
- Published
- 2015-08-10
- Pages
- 1365-1374
- OpenAlex
- W2008857988
- Cited by
- 1,021
- References
- 33
- FWCI
- 23.29
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.