Fetching the paper…
Reading the bibliography…
Graph classification is a fundamental but challenging issue for numerous real-world applications.
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,”
1991
Earlier work this paper cites.
J. Atwood and D. Towsley, “Diffusion-convolutional neural networks,” in
2001
Earlier work this paper cites.
H. Kashima, K. Tsuda, and A. Inokuchi, “Marginalized kernels between labeled graphs,” in
2003
Earlier work this paper cites.
H. Toivonen, A. Srinivasan, R. D. King, S. Kramer, and C. Helma, “Statistical evaluation of the predictive toxicology challenge 2000–2001,”
2003
Earlier work this paper cites.
T. Gärtner, P. Flach, and S. Wrobel, “On graph kernels: Hardness results and efficient alternatives,”
2003
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,”
2005
Earlier work this paper cites.
J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graphs over time: densification laws, shrinking diameters and possible explanations,” in
2005
Earlier work this paper cites.
I. S. Dhillon, Y. Guan, and B. Kulis, “Weighted graph cuts without eigenvectors a multilevel approach,”
2007
Earlier work this paper cites.
N. Przulj, “Biological network comparison using graphlet degree distribution,”
2007
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,”
2008
Earlier work this paper cites.
N. Wale, I. A. Watson, and G. Karypis, “Comparison of descriptor spaces for chemical compound retrieval and classification,”
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
2009
Earlier work this paper cites.
N. Shervashidze, P. Schweitzer, E. J. v. Leeuwen, K. Mehlhorn, and K. M. Borgwardt, “Weisfeiler-lehman graph kernels,”
2011
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in
2012
Earlier work this paper cites.
M. K. Ng, Q. Wu, and Y. Ye, “Co-transfer learning via joint transition probability graph based method,” in
2012
Earlier work this paper cites.
J. Sánchez, F. Perronnin, T. Mensink, and J. Verbeek, “Image classification with the fisher vector: Theory and practice,”
2013
Earlier work this paper cites.
Q. Wu, M. K. Ng, and Y. Ye, “Cotransfer learning using coupled markov chains with restart,”
2014
Earlier work this paper cites.
J. Bruna, W. Zaremba, A. Szlam, and Y. Lecun, “Spectral networks and locally connected networks on graphs,” in
2014
Cited alongside, same era.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in
2014
Cited alongside, same era.
C. Szegedy, W. Liu, Y. Jia, P. Sermanet, S. Reed, D. Anguelov, D. Erhan, V. Vanhoucke, and A. Rabinovich, “Going deeper with convolutions,” in
2015
Cited alongside, same era.
M. Henaff, J. Bruna, and Y. LeCun, “Deep convolutional networks on graph-structured data,”
2015
Cited alongside, same era.
P. Yanardag and S. Vishwanathan, “Deep graph kernels,” in
2015
Cited alongside, same era.
Z. Luo, L. Liu, J. Yin, Y. Li, and Z. Wu, “Deep learning of graphs with ngram convolutional neural networks,”
2017
Later among the works it cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in
2017
Later among the works it cites.
A. G. Duran and M. Niepert, “Learning graph representations with embedding propagation,” in
2017
Later among the works it cites.
Y. Dong, N. V. Chawla, and A. Swami, “metapath2vec: Scalable representation learning for heterogeneous networks,” in
2017
Later among the works it cites.
F. Monti, D. Boscaini, J. Masci, E. Rodolà, J. Svoboda, and M. M. Bronstein, “Geometric deep learning on graphs and manifolds using mixture model cnns,” in
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in
2016
Cited alongside, same era.
M. K. Ng, Q. Wu, and C. Shen, “A fast markov chain based algorithm for miml learning,”
2016
Cited alongside, same era.
Z. Zhang, S. Fidler, and R. Urtasun, “Instance-level segmentation for autonomous driving with deep densely connected mrfs,” in
2016
Cited alongside, same era.
Y. Li, R. Zemel, M. Brockschmidt, and D. Tarlow, “Gated graph sequence neural networks,” in
2016
Cited alongside, same era.
P. Wang, C. Yuan, W. Hu, B. Li, and Y. Zhang, “Graph based skeleton motion representation and similarity measurement for action recognition,” in
2016
Cited alongside, same era.
H. Wang, P. Zhang, X. Zhu, I. W.-H. Tsang, L. Chen, C. Zhang, and X. Wu, “Incremental subgraph feature selection for graph classification,”
2016
Cited alongside, same era.
L. G. Gómez and J.-C. Delvenne, “Dynamics based features for graph classification,” in
2017
Later among the works it cites.
P. Goyal and E. Ferrara, “Graph embedding techniques, applications, and performance: A survey,”
2018
Closest in time.
F. Orsini, D. Baracchi, and P. Frasconi, “Shift aggregate extract networks,”
2018
Closest in time.
L. Wang, Y. Xiong, Z. Wang, Y. Qiao, D. Lin, X. Tang, and L. Van Gool, “Temporal segment networks for action recognition in videos,”
2018
Closest in time.
J. Gou, Y. Xu, D. Zhang, Q. Mao, L. Du, and Y. Zhan, “Two-phase linear reconstruction measure-based classification for face recognition,”
2018
Closest in time.
J. Gou, Z. Yi, D. Zhang, Y. Zhan, X. Shen, and L. Du, “Sparsity and geometry preserving graph embedding for dimensionality reduction,”
2018
Closest in time.
J. Jiang, Z. Cui, C. Xu, and J. Yang, “Gaussian-induced convolution for graphs,” in
2019
Closest in time.
J. Gou, H. Ma, W. Ou, S. Zeng, Y. Rao, and H. Yang, “A generalized mean distance-based k-nearest neighbor classifier,”
2019
Closest in time.
W. Zhao, Z. Cui, C. Xu, C. Li, T. Zhang, and J. Yang, “Hashing graph convolution for node classification,” in
2019
Closest in time.
R. Liu, C. Xu, T. Zhang, W. Zhao, Z. Cui, and J. Yang, “Si-gcn: Structure-induced graph convolution network for skeleton-based action recognition,” in
2019
Closest in time.
I. Barnett, N. Malik, M. Kuijjer, P. Mucha, and J.-P. Onnela, “Feature-based classification of networks,”
2019
Closest in time.
M. Niepert, M. Ahmed, and K. Kutzkov, “Learning convolutional neural networks for graphs,” in
2023
Closest in time.