Fetching the paper…
Reading the bibliography…
The space of graphs is often characterised by a non-trivial geometry, which complicates learning and inference in practical applications.
C. Bonferroni, “Teoria statistica delle classi e calcolo delle probabilita,” Pubblicazioni del R. Istituto Superiore di Scienze Economiche e Commericiali di Firenze , vol. 8, pp. 3–62, 1936
1936
Earlier work this paper cites.
H. B. Mann and D. R. Whitney, “On a test of whether one of two random variables is stochastically larger than the other,” The Annals of Mathematical Statistics , pp. 50–60, 1947
1947
Earlier work this paper cites.
E. S. Page, “Continuous inspection schemes,” Biometrika , vol. 41, no. 1/2, pp. 100–115, 1954
1954
Earlier work this paper cites.
D. C. Montgomery, Introduction to Statistical Quality Control . John Wiley & Sons, 2007
2007
Earlier work this paper cites.
T. Lin and H. Zha, “Riemannian manifold learning,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 30, no. 5, pp. 796–809, 2008
2008
Earlier work this paper cites.
J. Sun, Y. Xie, H. Zhang, and C. Faloutsos, “Less is more: Sparse graph mining with compact matrix decomposition,” Statistical Analysis and Data Mining: The ASA Data Science Journal , vol. 1, no. 1, pp. 6–22, 2008
2008
Earlier work this paper cites.
M. E. J. Newman, Networks: An Introduction . Oxford, UK: Oxford University Press, 2010
2010
Earlier work this paper cites.
J. Richiardi, S. Achard, H. Bunke, and D. Van De Ville, “Machine learning with brain graphs: Predictive modeling approaches for functional imaging in systems neuroscience,” IEEE Signal Processing Magazine , vol. 30, no. 3, pp. 58–70, 2013
2013
Earlier work this paper cites.
L. Livi and A. Rizzi, “The graph matching problem,” Pattern Analysis and Applications , vol. 16, no. 3, pp. 253–283, 2013
2013
Earlier work this paper cites.
L. Akoglu and C. Faloutsos, “Anomaly, event, and fraud detection in large network datasets,” in Proceedings of the sixth ACM international conference on Web search and data mining . ACM, 2013, pp. 773–774
2013
Earlier work this paper cites.
M. R. Bridson and A. Haefliger, Metric Spaces of Non-positive Curvature . Springer Science & Business Media, 2013, vol. 319
2013
Earlier work this paper cites.
R. C. Wilson, E. R. Hancock, E. Pȩkalska, and R. P. W. Duin, “Spherical and hyperbolic Embeddings of data,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 36, no. 11, pp. 2255–2269, Nov. 2014
2014
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in Advances in Neural Information Processing Systems , 2014, pp. 2672–2680
2014
Earlier work this paper cites.
G. Ditzler, M. Roveri, C. Alippi, and R. Polikar, “Learning in nonstationary environments: A survey,” IEEE Computational Intelligence Magazine , vol. 10, no. 4, pp. 12–25, Nov. 2015
2015
Earlier work this paper cites.
P. Holme, “Modern temporal network theory: a colloquium,” The European Physical Journal B , vol. 88, no. 9, p. 234, 2015
2015
Earlier work this paper cites.
S. Ranshous, S. Shen, D. Koutra, S. Harenberg, C. Faloutsos, and N. F. Samatova, “Anomaly detection in dynamic networks: a survey,” Wiley Interdisciplinary Reviews: Computational Statistics , vol. 7, no. 3, pp. 223–247, 2015
2015
Earlier work this paper cites.
L. Akoglu, H. Tong, and D. Koutra, “Graph based anomaly detection and description: a survey,” Data mining and knowledge discovery , vol. 29, no. 3, pp. 626–688, 2015
2015
Earlier work this paper cites.
L. Peel and A. Clauset, “Detecting change points in the large-scale structure of evolving networks.” in AAAI , vol. 15, 2015, pp. 1–11
2015
Earlier work this paper cites.
J. Straub, J. Chang, O. Freifeld, and J. Fisher III, “A Dirichlet process mixture model for spherical data,” in Proceedings of the 18th International Conference on Artificial Intelligence and Statistics , vol. 38, San Diego, CA, USA, 2015, pp. 930–938
2015
Cited alongside, same era.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in International Conference on Learning Representations , 2015
2015
Cited alongside, same era.
B. J. Jain, “On the geometry of graph spaces,” Discrete Applied Mathematics , vol. 214, pp. 126–144, 2016
2016
Cited alongside, same era.
N. Masuda and R. Lambiotte, A Guide to Temporal Networks , ser. Series on Complexity Science. Singapore: World Scientific Publishing Company, 2016
2016
Cited alongside, same era.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” NIPS Workshop on Bayesian Deep Learning , 2016
A. Li, S. P. Cornelius, Y.-Y. Liu, L. Wang, and A.-L. Barabási, “The fundamental advantages of temporal networks,” Science , vol. 358, no. 6366, pp. 1042–1046, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
M. Nickel and D. Kiela, “Poincaré embeddings for learning hierarchical representations,” in Advances in Neural Information Processing Systems , 2017, pp. 6341–6350
2017
Later among the works it cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in International Conference on Learning Representations , 2017
2017
Later among the works it cites.
M. Simonovsky and N. Komodakis, “Dynamic edge-conditioned filters in convolutional neural networks on graphs,” in Conference on Computer Vision and Pattern Recognition , 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
A. Makhzani, J. Sdhlens, N. Jaitly, and I. Goodfellow, “Adversarial autoencoders,” in International Conference on Learning Representations , 2016
2016
Cited alongside, same era.
I. Barnett and J.-P. Onnela, “Change point detection in correlation networks,” Scientific reports , vol. 6, p. 18893, 2016
2016
Cited alongside, same era.
2016
Cited alongside, same era.
R. Giryes, G. Sapiro, and A. M. Bronstein, “Deep neural networks with random Gaussian weights: A universal classification strategy?” IEEE Transactions on Signal Processing , vol. 64, no. 13, pp. 3444–3457, Jul. 2016
2016
Cited alongside, same era.
F. Emmert-Streib, M. Dehmer, and Y. Shi, “Fifty years of graph matching, network alignment and network comparison,” Information Sciences , vol. 346, pp. 180–197, 2016
2016
Cited alongside, same era.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Advances in Neural Information Processing Systems , 2016, pp. 3844–3852
2016
Cited alongside, same era.
Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel, “Gated graph sequence neural networks,” in International Conference on Learning Representations , 2016
2016
Cited alongside, same era.
2017
Later among the works it cites.
S. Yan, Y. Xiong, and D. Lin, “Spatial temporal graph convolutional networks for skeleton-based action recognition,” in AAAI , 2018
2017
Later among the works it cites.
D. Zambon, L. Livi, and C. Alippi, “Anomaly and change detection in graph streams through constant-curvature manifold embeddings,” in IEEE International Joint Conference on Neural Networks , Rio de Janeiro, Brasil, Jul. 2018, pp. 1–8
2018
Closest in time.
Y. Li, R. Yu, C. Shahabi, and Y. Liu, “Diffusion convolutional recurrent neural network: Data-driven traffic forecasting,” in International Conference on Learning Representations , 2018
2018
Closest in time.
M. Simonovsky and N. Komodakis, “GraphVAE: Towards generation of small graphs using variational autoencoders,” in 27th International Conference on Artificial Neural Networks , 2018, pp. 412–422
2018
Closest in time.
2018
Closest in time.
D. Zambon, C. Alippi, and L. Livi, “Concept drift and anomaly detection in graph streams,” IEEE Transactions on Neural Networks and Learning Systems , pp. 1–14, Mar. 2018
2018
Closest in time.
2018
Closest in time.
S. Pan, R. Hu, G. Long, J. Jiang, L. Yao, and C. Zhang, “Adversarially regularized graph autoencoder for graph embedding,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18 . International Joint Conferences on Artificial Intelligence Organization, 7 2018, pp. 2609–2615
2018
Closest in time.
T. R. Davidson, L. Falorsi, N. De Cao, T. Kipf, and J. M. Tomczak, “Hyperspherical variational auto-encoders,” 34th Conference on Uncertainty in Artificial Intelligence (UAI-18) , 2018
2018
Closest in time.
E. O. Korman, “Autoencoding topology,” arXiv preprint arXiv:1803.00156 , 2018
2018
Closest in time.
H. Shao, A. Kumar, and P. T. Fletcher, “The riemannian geometry of deep generative models,” in CVPR Workshops , 2018
2018
Closest in time.
N. Chen, A. Klushyn, R. Kurle, X. Jiang, J. Bayer, and P. van der Smagt, “Metrics for deep generative models,” in AISTATS , 2018
2018
Closest in time.