FastGAE: Scalable graph autoencoders with stochastic subgraph decoding
暂无分享,去创建一个
Michalis Vazirgiannis | Romain Hennequin | Guillaume Salha | Jean-Baptiste Remy | Manuel Moussallam | Romain Hennequin | Manuel Moussallam | M. Vazirgiannis | Guillaume Salha-Galvan | Jean-Baptiste Remy
[1] Stefano Ermon,et al. Graphite: Iterative Generative Modeling of Graphs , 2018, ICML.
[2] Michalis Vazirgiannis,et al. A Degeneracy Framework for Scalable Graph Autoencoders , 2019, IJCAI.
[3] J. Leskovec,et al. Open Graph Benchmark: Datasets for Machine Learning on Graphs , 2020, NeurIPS.
[4] Tingyang Xu,et al. DropEdge: Towards Deep Graph Convolutional Networks on Node Classification , 2020, ICLR.
[5] Rishabh K. Iyer,et al. Learning From Less Data: Diversified Subset Selection and Active Learning in Image Classification Tasks , 2018, ArXiv.
[6] Jimmy Ba,et al. Adam: A Method for Stochastic Optimization , 2014, ICLR.
[7] Jure Leskovec,et al. Representation Learning on Graphs: Methods and Applications , 2017, IEEE Data Eng. Bull..
[8] Max Welling,et al. Auto-Encoding Variational Bayes , 2013, ICLR.
[9] Jure Leskovec,et al. Graph Convolutional Neural Networks for Web-Scale Recommender Systems , 2018, KDD.
[10] Le Song,et al. Stochastic Training of Graph Convolutional Networks with Variance Reduction , 2017, ICML.
[11] Kilian Q. Weinberger,et al. Simplifying Graph Convolutional Networks , 2019, ICML.
[12] Emmanuel Abbe,et al. Community detection and stochastic block models: recent developments , 2017, Found. Trends Commun. Inf. Theory.
[13] Xavier Bresson,et al. Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering , 2016, NIPS.
[14] Enhong Chen,et al. Learning Deep Representations for Graph Clustering , 2014, AAAI.
[15] Cao Xiao,et al. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling , 2018, ICLR.
[16] Philip S. Yu,et al. A Comprehensive Survey on Graph Neural Networks , 2019, IEEE Transactions on Neural Networks and Learning Systems.
[17] Mark Newman,et al. Networks: An Introduction , 2010 .
[18] Vladimir Batagelj,et al. An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.
[19] Rajgopal Kannan,et al. GraphSAINT: Graph Sampling Based Inductive Learning Method , 2019, ICLR.
[20] Michalis Vazirgiannis,et al. Gravity-Inspired Graph Autoencoders for Directed Link Prediction , 2019, CIKM.
[21] Yuanzhi Li,et al. An Alternative View: When Does SGD Escape Local Minima? , 2018, ICML.
[22] Chun Wang,et al. MGAE: Marginalized Graph Autoencoder for Graph Clustering , 2017, CIKM.
[23] Wenwu Zhu,et al. Structural Deep Network Embedding , 2016, KDD.
[24] Max Welling,et al. Semi-Supervised Classification with Graph Convolutional Networks , 2016, ICLR.
[25] James T. Kwok,et al. Effective Decoding in Graph Auto-Encoder using Triadic Closure , 2019, AAAI.
[26] Omer Levy,et al. word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method , 2014, ArXiv.
[27] Phi Vu Tran,et al. Multi-Task Graph Autoencoders , 2018, ArXiv.
[28] Geoffrey E. Hinton,et al. Deep Learning , 2015, Nature.
[29] Nikos Komodakis,et al. GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoders , 2018, ICANN.
[30] Pierre Baldi,et al. Autoencoders, Unsupervised Learning, and Deep Architectures , 2011, ICML Unsupervised and Transfer Learning.
[31] Jure Leskovec,et al. Inductive Representation Learning on Large Graphs , 2017, NIPS.
[32] Jan Eric Lenssen,et al. Fast Graph Representation Learning with PyTorch Geometric , 2019, ArXiv.
[33] Michalis Vazirgiannis,et al. The core decomposition of networks: theory, algorithms and applications , 2019, The VLDB Journal.
[34] Xiaoning Qian,et al. Semi-Implicit Graph Variational Auto-Encoders , 2019, NeurIPS.
[35] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[36] Joan Bruna,et al. Spectral Networks and Locally Connected Networks on Graphs , 2013, ICLR.
[37] Mingzhe Wang,et al. LINE: Large-scale Information Network Embedding , 2015, WWW.
[38] Qi Liu,et al. Constrained Graph Variational Autoencoders for Molecule Design , 2018, NeurIPS.
[39] Max Welling,et al. Graph Convolutional Matrix Completion , 2017, ArXiv.
[40] Gaël Varoquaux,et al. Scikit-learn: Machine Learning in Python , 2011, J. Mach. Learn. Res..
[41] Geoffrey E. Hinton,et al. Learning internal representations by error propagation , 1986 .
[42] Lina Yao,et al. Adversarially Regularized Graph Autoencoder , 2018, IJCAI.
[43] Jean-Loup Guillaume,et al. Fast unfolding of communities in large networks , 2008, 0803.0476.
[44] Samy Bengio,et al. Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks , 2019, KDD.
[45] Niloy Ganguly,et al. NeVAE: A Deep Generative Model for Molecular Graphs , 2018, AAAI.
[46] Steven Skiena,et al. DeepWalk: online learning of social representations , 2014, KDD.
[47] Risto Miikkulainen,et al. Improved Training Speed, Accuracy, and Data Utilization Through Loss Function Optimization , 2019, 2020 IEEE Congress on Evolutionary Computation (CEC).
[48] Michalis Vazirgiannis,et al. Simple and Effective Graph Autoencoders with One-Hop Linear Models , 2020, ArXiv.
[49] Jure Leskovec,et al. node2vec: Scalable Feature Learning for Networks , 2016, KDD.
[50] Jeffrey Dean,et al. Distributed Representations of Words and Phrases and their Compositionality , 2013, NIPS.
[51] Qiongkai Xu,et al. GraRep: Learning Graph Representations with Global Structural Information , 2015, CIKM.
[52] Tomaso A. Poggio,et al. Regularization Theory and Neural Networks Architectures , 1995, Neural Computation.
[53] Regina Barzilay,et al. Junction Tree Variational Autoencoder for Molecular Graph Generation , 2018, ICML.