Fetching the paper…
Reading the bibliography…
Graphs are a fundamental abstraction for modeling relational data.
On random graphs
Erdös, P. and Rényi, A · 1959
Earlier work this paper cites.
A reduction of a graph to a canonical form and an algebra arising during this reduction
Weisfeiler, B. and Lehman, A · 1968
Earlier work this paper cites.
Stochastic blockmodels: First steps
Holland, P. W., Laskey, K. B., and Leinhardt, S · 1983
Earlier work this paper cites.
Latent variable models: An introduction to factor, path, and structural analysis
Loehlin, J. C · 1998
Earlier work this paper cites.
Collective dynamics of ‘small-world’ networks
Watts, D. J. and Strogatz, S. H · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
Barabasi, A.-L. and Albert, R · 1999
Earlier work this paper cites.
Laplacian eigenmaps and spectral techniques for embedding and clustering
Belkin, M. and Niyogi, P · 2002
Earlier work this paper cites.
Learning with kernels: Support vector machines, regularization, optimization, and beyond
Schölkopf, B. and Smola, A. J · 2002
Earlier work this paper cites.
Link-based classification
Lu, Q. and Getoor, L · 2003
Earlier work this paper cites.
The structure and function of complex networks
Newman, M. E · 2003
Earlier work this paper cites.
A brief history of generative models for power law and lognormal distributions
Mitzenmacher, M · 2004
Earlier work this paper cites.
Non-linear dimensionality reduction by locally linear isomaps
Saxena, A., Gupta, A., and Mukerjee, A · 2004
Earlier work this paper cites.
Kernel methods for pattern analysis
Shawe-Taylor, J. and Cristianini, N · 2004
Earlier work this paper cites.
A new model for learning in graph domains
Gori, M., Monfardini, G., and Scarselli, F · 2005
Earlier work this paper cites.
Graph mining: Laws, generators, and algorithms
Chakrabarti, D. and Faloutsos, C · 2006
Earlier work this paper cites.
A kernel method for the two-sample-problem
Gretton, A., Borgwardt, K., Rasch, M., Schölkopf, B., and Smola, A · 2007
Earlier work this paper cites.
A hilbert space embedding for distributions
Smola, A., Gretton, A., Song, L., and Schölkopf, B · 2007
Earlier work this paper cites.
Visualizing data using t-sne
Maaten, L. v. d. and Hinton, G · 2008
Earlier work this paper cites.
Collective classification in network data
Sen, P., Namata, G. M., Bilgic, M., Getoor, L., Gallagher, B., and Eliassi-Rad, T · 2008
Earlier work this paper cites.
Graphical models, exponential families, and variational inference
Wainwright, M. J., Jordan, M. I., et al · 2008
Earlier work this paper cites.
Deep learning via semi-supervised embedding
Weston, J., Ratle, F., and Collobert, R · 2008
Earlier work this paper cites.
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., and Monfardini, G · 2009
Cited alongside, same era.
The Weisfeiler-Lehman method and graph isomorphism testing
Douglas, B. L · 2011
Cited alongside, same era.
Scikit-learn: Machine learning in python
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., et al · 2011
Cited alongside, same era.
Weisfeiler-Lehman graph kernels
Shervashidze, N., Schweitzer, P., Leeuwen, E. J. v., Mehlhorn, K., and Borgwardt, K. M · 2011
Cited alongside, same era.
Leveraging social media networks for classification
Tang, L. and Liu, H · 2011
Cited alongside, same era.
Spectral networks and locally connected networks on graphs
Bruna, J., Zaremba, W., Szlam, A., and LeCun, Y · 2013
Neural message passing for quantum chemistry
Gilmer, J., Schoenholz, S., Riley, P., Vinyals, O., and Dahl, G · 2017
Later among the works it cites.
Deep generative models for relational data with side information
Hu, C., Rai, P., and Carin, L · 2017
Later among the works it cites.
Learning graphical state transitions
Johnson, D · 2017
Later among the works it cites.
Semi-supervised classification with graph convolutional networks
Kipf, T. N. and Welling, M · 2017
Later among the works it cites.
Molecular de-novo design through deep reinforcement learning
Olivecrona, M., Blaschke, T., Engkvist, O., and Chen, H · 2017
Later among the works it cites.
Hunt for the unique, stable, sparse and fast feature learning on graphs
Verma, S. and Zhang, Z.-L · 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…
Cited alongside, same era.
Distributed representations of words and phrases and their compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G. S., and Dean, J · 2013
Cited alongside, same era.
Auto-encoding variational bayes
Kingma, D. P. and Welling, M · 2014
Cited alongside, same era.
Semi-supervised learning with deep generative models
Kingma, D. P., Mohamed, S., Rezende, D. J., and Welling, M · 2014
Cited alongside, same era.
Structured generative models of natural source code
Maddison, C. and Tarlow, D · 2014
Cited alongside, same era.
Deepwalk: Online learning of social representations
Perozzi, B., Al-Rfou, R., and Skiena, S · 2014
Cited alongside, same era.
Convolutional networks on graphs for learning molecular fingerprints
Duvenaud, D., Maclaurin, D., Iparraguirre, J., Bombarell, R., Hirzel, T., Aspuru-Guzik, A., and Adams, R · 2015
Cited alongside, same era.
Relational deep learning: A deep latent variable model for link prediction
Wang, H., Shi, X., and Yeung, D.-Y · 2017
Later among the works it cites.
NetGAN: Generating graphs via random walks
Bojchevski, A., Shchur, O., Zügner, D., and Günnemann, S · 2018
Closest in time.
Few-shot learning with graph neural networks
Garcia, V. and Bruna, J · 2018
Closest in time.
Junction tree variational autoencoder for molecular graph generation
Jin, W., Barzilay, R., and Jaakkola, T · 2018
Closest in time.
Neural relational inference for interacting systems
Kipf, T., Fetaya, E., Wang, K.-C., Welling, M., and Zemel, R · 2018
Closest in time.
Learning deep generative models of graphs
Li, Y., Vinyals, O., Dyer, C., Pascanu, R., and Battaglia, P · 2018
Closest in time.
Adversarially regularized graph autoencoder for graph embedding
Pan, S., Hu, R., Long, G., Jiang, J., Yao, L., and Zhang, C · 2018
Closest in time.
Designing random graph models using variational autoencoders with applications to chemical design
Samanta, B., De, A., Ganguly, N., and Gomez-Rodriguez, M · 2018
Closest in time.
GraphVAE: Towards generation of small graphs using variational autoencoders
Simonovsky, M. and Komodakis, N · 2018
Closest in time.
Graph attention networks
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., and Bengio, Y · 2018
Closest in time.
GraphGAN: Graph representation learning with generative adversarial nets
Wang, H., Wang, J., Wang, J., Zhao, M., Zhang, W., Zhang, F., Xie, X., and Guo, M · 2018
Closest in time.
Inference in probabilistic graphical models by graph neural networks
Yoon, K., Liao, R., Xiong, Y., Zhang, L., Fetaya, E., Urtasun, R., Zemel, R., and Pitkow, X · 2018
Closest in time.
GraphRNN: A deep generative model for graphs
You, J., Ying, R., Ren, X., Hamilton, W. L., and Leskovec, J · 2018
Closest in time.
Stochastic optimization of sorting networks via continuous relaxations
Grover, A., Wang, E., Zweig, A., and Ermon, S · 2019
Closest in time.