Fetching the paper…
Reading the bibliography…
The convolution operator at the core of many modern neural architectures can effectively be seen as performing a dot product between an input matrix and a filter.
A. K. Debnath, R. L. Lopez de Compadre, G. Debnath, A. J. Shusterman, and C. Hansch, “Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity,” Journal of medicinal chemistry , vol. 34, no. 2, pp. 786–797, 1991
1991
Earlier work this paper cites.
M. V. Ramana, E. R. Scheinerman, and D. Ullman, “Fractional isomorphism of graphs,” Discrete Mathematics , vol. 132, no. 1-3, pp. 247–265, 1994
1994
Earlier work this paper cites.
A. Sperduti and A. Starita, “Supervised neural networks for the classification of structures,” IEEE Transactions on Neural Networks , vol. 8, no. 3, pp. 714–735, 1997
1997
Earlier work this paper cites.
J. Atwood and D. Towsley, “Diffusion-convolutional neural networks,” in Advances in neural information processing systems , 2016, pp. 1993–2001
2001
Earlier work this paper cites.
C. Helma, R. D. King, S. Kramer, and A. Srinivasan, “The predictive toxicology challenge 2000–2001,” Bioinformatics , vol. 17, no. 1, pp. 107–108, 2001
2001
Earlier work this paper cites.
J. Ramon and T. Gärtner, “Expressivity versus efficiency of graph kernels,” in Proceedings of the first international workshop on mining graphs, trees and sequences , 2003, pp. 65–74
2003
Earlier work this paper cites.
H. Kashima, K. Tsuda, and A. Inokuchi, “Marginalized kernels between labeled graphs,” in Proceedings of the 20th international conference on machine learning (ICML-03) , 2003, pp. 321–328
2003
Earlier work this paper cites.
P. D. Dobson and A. J. Doig, “Distinguishing enzyme structures from non-enzymes without alignments,” Journal of molecular biology , vol. 330, no. 4, pp. 771–783, 2003
2003
Earlier work this paper cites.
I. Schomburg, A. Chang, C. Ebeling, M. Gremse, C. Heldt, G. Huhn, and D. Schomburg, “Brenda, the enzyme database: updates and major new developments,” Nucleic acids research , vol. 32, no. suppl_1, pp. D431–D433, 2004
2004
Earlier work this paper cites.
K. M. Borgwardt and H.-P. Kriegel, “Shortest-path kernels on graphs,” in Fifth IEEE international conference on data mining (ICDM’05) . IEEE, 2005, pp. 8–pp
2005
Earlier work this paper cites.
K. M. Borgwardt, C. S. Ong, S. Schönauer, S. Vishwanathan, A. J. Smola, and H.-P. Kriegel, “Protein function prediction via graph kernels,” Bioinformatics , vol. 21, no. suppl_1, pp. i47–i56, 2005
2005
Earlier work this paper cites.
L. Ralaivola, S. J. Swamidass, H. Saigo, and P. Baldi, “Graph kernels for chemical informatics,” Neural networks , vol. 18, no. 8, pp. 1093–1110, 2005
2005
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE transactions on neural networks , vol. 20, no. 1, pp. 61–80, 2008
2008
Earlier work this paper cites.
N. Wale, I. A. Watson, and G. Karypis, “Comparison of descriptor spaces for chemical compound retrieval and classification,” Knowledge and Information Systems , vol. 14, no. 3, pp. 347–375, 2008
2008
Earlier work this paper cites.
N. Shervashidze, S. Vishwanathan, T. Petri, K. Mehlhorn, and K. Borgwardt, “Efficient graphlet kernels for large graph comparison,” in Artificial intelligence and statistics . PMLR, 2009, pp. 488–495
2009
Earlier work this paper cites.
A. Micheli, “Neural network for graphs: A contextual constructive approach,” IEEE Transactions on Neural Networks , vol. 20, no. 3, pp. 498–511, 2009
2009
Earlier work this paper cites.
N. Shervashidze, P. Schweitzer, E. J. Van Leeuwen, K. Mehlhorn, and K. M. Borgwardt, “Weisfeiler-lehman graph kernels.” Journal of Machine Learning Research , vol. 12, no. 9, 2011
2011
Earlier work this paper cites.
C.-C. Chang and C.-J. Lin, “Libsvm: a library for support vector machines,” ACM transactions on intelligent systems and technology (TIST) , vol. 2, no. 3, pp. 1–27, 2011
2011
Earlier work this paper cites.
R. P. Duin and E. Pekalska, “The dissimilarity space: Bridging structural and statistical pattern recognition,” Pattern Recognition Letters , vol. 33, no. 7, pp. 826–832, 2012
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
J. J. Irwin, T. Sterling, M. M. Mysinger, E. S. Bolstad, and R. G. Coleman, “Zinc: a free tool to discover chemistry for biology,” Journal of chemical information and modeling , vol. 52, no. 7, pp. 1757–1768, 2012
2012
Earlier work this paper cites.
L. Bai and E. R. Hancock, “Graph kernels from the jensen-shannon divergence,” Journal of mathematical imaging and vision , vol. 47, no. 1, pp. 60–69, 2013
2013
Earlier work this paper cites.
A. Lima, L. Rossi, and M. Musolesi, “Coding together at scale: Github as a collaborative social network,” in Eighth international AAAI conference on weblogs and social media , 2014
2014
Earlier work this paper cites.
C. Ye, C. H. Comin, T. K. D. Peron, F. N. Silva, F. A. Rodrigues, L. d. F. Costa, A. Torsello, and E. R. Hancock, “Thermodynamic characterization of networks using graph polynomials,” Physical Review E , vol. 92, no. 3, p. 032810, 2015
2015
Earlier work this paper cites.
L. Bai, L. Rossi, A. Torsello, and E. R. Hancock, “A quantum jensen–shannon graph kernel for unattributed graphs,” Pattern Recognition , vol. 48, no. 2, pp. 344–355, 2015
2015
Cited alongside, same era.
L. Rossi, A. Torsello, and E. R. Hancock, “Measuring graph similarity through continuous-time quantum walks and the quantum jensen-shannon divergence,” Physical Review E , vol. 91, no. 2, p. 022815, 2015
2015
Cited alongside, same era.
P. Yanardag and S. Vishwanathan, “Deep graph kernels,” in Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining , 2015, pp. 1365–1374
2015
Cited alongside, same era.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in Proceedings of the 5th International Conference on Learning Representations , ser. ICLR ’17, 2017
2017
Cited alongside, same era.
Y. Zhang, L. Wang, R. C. Wilson, and K. Liu, “An r-convolution graph kernel based on fast discrete-time quantum walk,” IEEE Transactions on Neural Networks and Learning Systems , vol. 33, no. 1, pp. 292–303, 2020
2020
Later among the works it cites.
N. M. Kriege, F. D. Johansson, and C. Morris, “A survey on graph kernels,” Applied Network Science , vol. 5, no. 1, pp. 1–42, 2020
2020
Later among the works it cites.
L. Bai, L. Cui, Y. Jiao, L. Rossi, and E. Hancock, “Learning backtrackless aligned-spatial graph convolutional networks for graph classification,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2020
2020
Later among the works it cites.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip, “A comprehensive survey on graph neural networks,” IEEE transactions on neural networks and learning systems , vol. 32, no. 1, pp. 4–24, 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in International conference on machine learning . PMLR, 2017, pp. 1263–1272
2017
Cited alongside, same era.
G. Da San Martino, N. Navarin, and A. Sperduti, “Tree-based kernel for graphs with continuous attributes,” IEEE transactions on neural networks and learning systems , vol. 29, no. 7, pp. 3270–3276, 2017
2017
Cited alongside, same era.
D. Nebel, M. Kaden, A. Villmann, and T. Villmann, “Types of (dis-) similarities and adaptive mixtures thereof for improved classification learning,” Neurocomputing , vol. 268, pp. 42–54, 2017
2017
Cited alongside, same era.
M. Simonovsky and N. Komodakis, “Dynamic edge-conditioned filters in convolutional neural networks on graphs,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2017, pp. 3693–3702
2017
Cited alongside, same era.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” Advances in neural information processing systems , vol. 30, 2017
2017
Cited alongside, same era.
M. Zaheer, S. Kottur, S. Ravanbhakhsh, B. Póczos, R. Salakhutdinov, and A. J. Smola, “Deep sets,” in Proceedings of the 31st International Conference on Neural Information Processing Systems , 2017, pp. 3394–3404
2017
Cited alongside, same era.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
R. Levie, F. Monti, X. Bresson, and M. M. Bronstein, “Cayleynets: Graph convolutional neural networks with complex rational spectral filters,” IEEE Transactions on Signal Processing , vol. 67, no. 1, pp. 97–109, 2018
2018
Cited alongside, same era.
D. Chen, L. Jacob, and J. Mairal, “Convolutional kernel networks for graph-structured data,” in International Conference on Machine Learning . PMLR, 2020, pp. 1576–1586
2020
Later among the works it cites.
N. Navarin, D. Van Tran, and A. Sperduti, “Learning kernel-based embeddings in graph neural networks,” in ECAI 2020 . IOS Press, 2020, pp. 1387–1394
2020
Later among the works it cites.
2020
Later among the works it cites.
G. Nikolentzos, G. Dasoulas, and M. Vazirgiannis, “k-hop graph neural networks,” Neural Networks , vol. 130, pp. 195–205, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
X. Di, P. Yu, R. Bu, and M. Sun, “Mutual information maximization in graph neural networks,” in 2020 International Joint Conference on Neural Networks (IJCNN) . IEEE, 2020, pp. 1–7
2020
Later among the works it cites.
2020
Later among the works it cites.
W. Cong, M. Ramezani, and M. Mahdavi, “On provable benefits of depth in training graph convolutional networks,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Closest in time.
2021
Closest in time.
Z. Li, H. Liu, Z. Zhang, T. Liu, and N. N. Xiong, “Learning knowledge graph embedding with heterogeneous relation attention networks,” IEEE Transactions on Neural Networks and Learning Systems , vol. 33, no. 8, pp. 3961–3973, 2021
2021
Closest in time.
M. Eliasof, E. Haber, and E. Treister, “Pde-gcn: Novel architectures for graph neural networks motivated by partial differential equations,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Closest in time.
2021
Closest in time.
E. Englesson and H. Azizpour, “Generalized jensen-shannon divergence loss for learning with noisy labels,” Advances in Neural Information Processing Systems , vol. 34, pp. 30 284–30 297, 2021
2021
Closest in time.
2022
Closest in time.
A. Bicciato, L. Cosmo, G. Minello, L. Rossi, and A. Torsello, “Classifying me softly: A novel graph neural network based on features soft-alignment,” in Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) . Springer, 2022, pp. 43–53
2022
Closest in time.
B. Bevilacqua, F. Frasca, D. Lim, B. Srinivasan, C. Cai, G. Balamurugan, M. M. Bronstein, and H. Maron, “Equivariant subgraph aggregation networks,” in International Conference on Learning Representations , 2022
2022
Closest in time.
G. Bouritsas, F. Frasca, S. P. Zafeiriou, and M. Bronstein, “Improving graph neural network expressivity via subgraph isomorphism counting,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2022
2022
Closest in time.
——, “Gnn-lofi: A novel graph neural network through localized feature-based histogram intersection,” Pattern Recognition , vol. 148, p. 110210, 2024
2024
Closest in time.
T. Lei, W. Jin, R. Barzilay, and T. Jaakkola, “Deriving neural architectures from sequence and graph kernels,” in International Conference on Machine Learning . PMLR, 2017, pp. 2024–2033
2033
Closest in time.