Fetching the paper…
Reading the bibliography…
As large-scale graphs become more widespread, more and more computational challenges with extracting, processing, and interpreting large graph data are being exposed.
R. Bellman and R. E. Kalaba, Selected papers on mathematical trends in control theory . Dover Publications, 1964
1964
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long Short-Term Memory,” Neural Computation , vol. 9, no. 8, pp. 1735–1780, 11 1997. [Online]. Available: https://doi.org/10.1162/neco.1997.9.8.1735
1997
Earlier work this paper cites.
L. R. Medsker and L. Jain, “Recurrent neural networks,” Design and Applications , vol. 5, pp. 64–67, 2001
2001
Earlier work this paper cites.
D. Gibson, R. Kumar, and A. Tomkins, “Discovering large dense subgraphs in massive graphs,” in Proceedings of the 31st International Conference on Very Large Data Bases , 2005, pp. 721–732
2005
Earlier work this paper cites.
B. Kulis, S. Basu, I. Dhillon, and R. Mooney, “Semi-supervised graph clustering: a kernel approach,” in Proceedings of the 22nd International Conference on Machine Learning , 2005, pp. 457–464
2005
Earlier work this paper cites.
C. C. Aggarwal and H. Wang, Managing and mining graph data . Springer, 2010, vol. 40
2010
Earlier work this paper cites.
K. LeFevre and E. Terzi, “Grass: Graph structure summarization,” in Proceedings of the 2010 SIAM International Conference on Data Mining . SIAM, 2010, pp. 454–465
2010
Earlier work this paper cites.
P. Zhao, X. Li, D. Xin, and J. Han, “Graph cube: on warehousing and olap multidimensional networks,” in SIGMOD International Conference on Management of Data , 2011, pp. 853–864
2011
Earlier work this paper cites.
B. Karrer and M. E. Newman, “Stochastic blockmodels and community structure in networks,” Physical Review E , vol. 83, no. 1, p. 016107, 2011
2011
Earlier work this paper cites.
M. Kurant, M. Gjoka, C. T. Butts, and A. Markopoulou, “Walking on a graph with a magnifying glass: stratified sampling via weighted random walks,” in Proceedings of the ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems , 2011, pp. 281–292
2011
Earlier work this paper cites.
D. K. Hammond, P. Vandergheynst, and R. Gribonval, “Wavelets on graphs via spectral graph theory,” Applied and Computational Harmonic Analysis , vol. 30, no. 2, pp. 129–150, 2011
2011
Earlier work this paper cites.
2013
Earlier work this paper cites.
C. Doerr and N. Blenn, “Metric convergence in social network sampling,” in Proceedings of the 5th ACM Workshop on HotPlanet , 2013, pp. 45–50
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
2015
Earlier work this paper cites.
D. P. Kingma, T. Salimans, and M. Welling, “Variational dropout and the local reparameterization trick,” Advances in neural information processing systems , vol. 28, 2015
2015
Earlier work this paper cites.
M. P. Boobalan, D. Lopez, and X. Z. Gao, “Graph clustering using k-neighbourhood attribute structural similarity,” Applied soft computing , vol. 47, pp. 216–223, 2016
2016
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2016, pp. 855–864
2016
Earlier work this paper cites.
A. D. Stivala, J. H. Koskinen, D. A. Rolls, P. Wang, and G. L. Robins, “Snowball sampling for estimating exponential random graph models for large networks,” Social Networks , vol. 47, pp. 167–188, 2016
2016
Earlier work this paper cites.
X. Liang, X. Shen, J. Feng, L. Lin, and S. Yan, “Semantic object parsing with graph lstm,” in Computer Vision–ECCV 2016: 14th European Conference, Amsterdam, The Netherlands, October 11–14, 2016, Proceedings, Part I 14 . Springer, 2016, pp. 125–143
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” Advances in Neural Information Processing Systems , vol. 29, 2016
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” arXiv preprint arXiv:1611.07308 , 2016
2016
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in Neural Information Processing Systems . MIT Press, 2017, pp. 1024–1034
2017
Earlier work this paper cites.
C. Wang, S. Pan, G. Long, X. Zhu, and J. Jiang, “Mgae: Marginalized graph autoencoder for graph clustering,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 889–898
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Lio, Y. Bengio et al. , “Graph attention networks,” stat , vol. 1050, no. 20, pp. 10–48 550, 2017
2017
Earlier work this paper cites.
Y. Liu, T. Safavi, A. Dighe, and D. Koutra, “Graph summarization methods and applications: A survey,” ACM Computing Surveys (CSUR) , vol. 51, no. 3, pp. 1–34, 2018
2018
Earlier work this paper cites.
K. A. Kumar and P. Efstathopoulos, “Utility-driven graph summarization,” Proceedings of the VLDB Endowment , vol. 12, no. 4, pp. 335–347, 2018
2018
Earlier work this paper cites.
H. Cai, V. W. Zheng, and K. C.-C. Chang, “A comprehensive survey of graph embedding: Problems, techniques, and applications,” IEEE Transactions on Knowledge and Data Engineering , vol. 30, no. 9, pp. 1616–1637, 2018
2018
Earlier work this paper cites.
A. Taheri, K. Gimpel, and T. Berger-Wolf, “Learning graph representations with recurrent neural network autoencoders,” KDD Deep Learning Day , 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
A. Bojchevski, O. Shchur, D. Zügner, and S. Günnemann, “Netgan: Generating graphs via random walks,” in International conference on machine learning . PMLR, 2018, pp. 610–619
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
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
Earlier work this paper cites.
W. Huang, T. Zhang, Y. Rong, and J. Huang, “Adaptive sampling towards fast graph representation learning,” Advances in Neural Information Processing Systems , vol. 31, 2018
2018
Earlier work this paper cites.
S. E. Amiri, B. Adhikari, A. Bharadwaj, and B. A. Prakash, “Netgist: Learning to generate task-based network summaries,” in IEEE International Conference on Data Mining (ICDM) . IEEE, 2018, pp. 857–862
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Š. Čebirić, F. Goasdoué, H. Kondylakis, D. Kotzinos, I. Manolescu, G. Troullinou, and M. Zneika, “Summarizing semantic graphs: a survey,” The VLDB Journal , vol. 28, no. 3, pp. 295–327, 2019
2019
Cited alongside, same era.
C. Lee and D. J. Wilkinson, “A review of stochastic block models and extensions for graph clustering,” Applied Network Science , vol. 4, no. 1, pp. 1–50, 2019
2019
Cited alongside, same era.
L.-C. Zhang, “Graph sampling: An introduction,” The Survey Statistician , vol. 83, pp. 27–37, 2021
2021
Later among the works it cites.
X. Liu, M. Yan, L. Deng, G. Li, X. Ye, and D. Fan, “Sampling methods for efficient training of graph convolutional networks: A survey,” IEEE/CAA Journal of Automatica Sinica , vol. 9, no. 2, pp. 205–234, 2021
2021
Later among the works it cites.
Y. Xie, B. Yu, S. Lv, C. Zhang, G. Wang, and M. Gong, “A survey on heterogeneous network representation learning,” Pattern recognition , vol. 116, p. 107936, 2021
2021
Later among the works it cites.
M. Xu, “Understanding graph embedding methods and their applications,” SIAM Review , vol. 63, no. 4, pp. 825–853, 2021
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Dumbrava, A. Bonifati, A. N. R. Diaz, and R. Vuillemot, “Approximate querying on property graphs,” in Scalable Uncertainty Management: 13th International Conference, SUM 2019, Compiègne, France, December 16–18, 2019, Proceedings 13 . Springer, 2019, pp. 250–265
2019
Cited alongside, same era.
2019
Cited alongside, same era.
S. Khoshraftar, S. Mahdavi, A. An, Y. Hu, and J. Liu, “Dynamic graph embedding via lstm history tracking,” in 2019 IEEE International Conference on Data Science and Advanced Analytics (DSAA) . IEEE, 2019, pp. 119–127
2019
Cited alongside, same era.
A. Taheri, K. Gimpel, and T. Berger-Wolf, “Learning to represent the evolution of dynamic graphs with recurrent models,” in Companion Proceedings of The 2019 World Wide Web Conference , 2019, pp. 301–307
2019
Cited alongside, same era.
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying graph convolutional networks,” in International Conference on Machine Learning . PMLR, 2019, pp. 6861–6871
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
Y. Yan, J. Zhu, M. Duda, E. Solarz, C. Sripada, and D. Koutra, “Groupinn: Grouping-based interpretable neural network for classification of limited, noisy brain data,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2019, pp. 772–782
2019
Cited alongside, same era.
2021
Later among the works it cites.
P. S. Chodrow, N. Veldt, and A. R. Benson, “Generative hypergraph clustering: From blockmodels to modularity,” Science Advances , vol. 7, no. 28, p. eabh1303, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
X. Lai, P. Yang, K. Wang, Q. Yang, and D. Yu, “Mgrnn: Structure generation of molecules based on graph recurrent neural networks,” Molecular Informatics , vol. 40, no. 10, p. 2100091, 2021
2021
Later among the works it cites.
S. Li, K. W. Wong, C. C. Fung, and D. Zhu, “Improving question answering over knowledge graphs using graph summarization,” in International Conference on Neural Information Processing . Springer, 2021, pp. 489–500
2021
Later among the works it cites.
L. Dang, Y. Nie, C. Long, Q. Zhang, and G. Li, “Msr-gcn: Multi-scale residual graph convolution networks for human motion prediction,” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2021, pp. 11 467–11 476
2021
Later among the works it cites.
E. Cai, J. Huang, B. Huang, S. Xu, and J. Zhu, “Grae: Graph recurrent autoencoder for multi-view graph clustering,” in 2021 4th International Conference on Algorithms, Computing and Artificial Intelligence , 2021, pp. 1–9
2021
Later among the works it cites.
G. Salha, R. Hennequin, and M. Vazirgiannis, “Simple and effective graph autoencoders with one-hop linear models,” in Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2020, Ghent, Belgium, September 14–18, 2020, Proceedings, Part I . Springer, 2021, pp. 319–334
2021
Later among the works it cites.
T. Kim, J. Oh, N. Y. Kim, S. Cho, and S.-Y. Yun, “Comparing kullback-leibler divergence and mean squared error loss in knowledge distillation,” in 30th International Joint Conference on Artificial Intelligence (IJCAI-21) . IJCAI, 2021, pp. 2628–2635
2021
Later among the works it cites.
K. Tu, P. Cui, D. Wang, Z. Zhang, J. Zhou, Y. Qi, and W. Zhu, “Conditional graph attention networks for distilling and refining knowledge graphs in recommendation,” in Proceedings of the 30th ACM International Conference on Information & Knowledge Management , 2021, pp. 1834–1843
2021
Later among the works it cites.
2021
Later among the works it cites.
J. Chen, Y. Saad, and Z. Zhang, “Graph coarsening: from scientific computing to machine learning,” SeMA Journal , pp. 1–37, 2022
2022
Later among the works it cites.
S. A. Bhavsar, V. H. Patil, and A. H. Patil, “Graph partitioning and visualization in graph mining: a survey,” Multimedia Tools and Applications , vol. 81, no. 30, pp. 43 315–43 356, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
X. Wang, D. Bo, C. Shi, S. Fan, Y. Ye, and S. Y. Philip, “A survey on heterogeneous graph embedding: methods, techniques, applications and sources,” IEEE Transactions on Big Data , 2022
2022
Later among the works it cites.
M. Hajiabadi, “Efficient graph summarization of large networks,” Ph.D. dissertation, University of Victoria, 2022
2022
Later among the works it cites.
L. Wu, P. Cui, J. Pei, L. Zhao, and L. Song, “Graph neural networks,” in Graph Neural Networks: Foundations, Frontiers, and Applications . Springer, 2022, pp. 27–37
2022
Later among the works it cites.
K. Ge, J.-Q. Zhao, and Y.-Y. Zhao, “Gr-gnn: Gated recursion-based graph neural network algorithm,” Mathematics , vol. 10, no. 7, p. 1171, 2022
2022
Later among the works it cites.
C.-Y. Zhang, Z.-L. Yao, H.-Y. Yao, F. Huang, and C. P. Chen, “Dynamic representation learning via recurrent graph neural networks,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , vol. 52, no. 3, pp. 468–479, 2022
2022
Later among the works it cites.
K. Zarzycki and M. Ławryńczuk, “Advanced predictive control for gru and lstm networks,” Information Sciences , vol. 616, pp. 229–254, 2022
2022
Later among the works it cites.
G. Wen, P. Cao, H. Bao, W. Yang, T. Zheng, and O. Zaiane, “Mvs-gcn: A prior brain structure learning-guided multi-view graph convolution network for autism spectrum disorder diagnosis,” Computers in Biology and Medicine , vol. 142, p. 105239, 2022
2022
Later among the works it cites.
N. Mrabah, M. Bouguessa, M. F. Touati, and R. Ksantini, “Rethinking graph auto-encoder models for attributed graph clustering,” IEEE Transactions on Knowledge and Data Engineering , 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
L. Chen, J. Cao, Y. Wang, W. Liang, and G. Zhu, “Multi-view graph attention network for travel recommendation,” Expert Systems with Applications , vol. 191, p. 116234, 2022
2022
Later among the works it cites.
Z. Li, Y. Zhao, Y. Zhang, and Z. Zhang, “Multi-relational graph attention networks for knowledge graph completion,” Knowledge-Based Systems , vol. 251, p. 109262, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
B. Wu, X. Liang, X. Zheng, J. Wang, and X. Zhou, “Reinforced sample selection for graph neural networks transfer learning,” in 2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) , 2022, pp. 1281–1288
2022
Later among the works it cites.
X. Zhao, J. Wu, H. Peng, A. Beheshti, J. J. Monaghan, D. McAlpine, H. Hernandez-Perez, M. Dras, Q. Dai, Y. Li et al. , “Deep reinforcement learning guided graph neural networks for brain network analysis,” Neural Networks , vol. 154, pp. 56–67, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
Ü. Çatalyürek, K. Devine, M. Faraj, L. Gottesbüren, T. Heuer, H. Meyerhenke, P. Sanders, S. Schlag, C. Schulz, D. Seemaier et al. , “More recent advances in (hyper) graph partitioning,” ACM Computing Surveys , vol. 55, no. 12, pp. 1–38, 2023
2023
Closest in time.
B. Mayer and B. Perozzi, “Scaling heterogeneous graph sampling and gnns with google cloud dataflow,” https://cloud.google.com/blog/products/ai-machine-learning/scaling-heterogeneous-graph-sampling-gnns-google-cloud-dataflow , 2022, accessed: April 4, 2023
2023
Closest in time.
G. Dong, M. Tang, Z. Wang, J. Gao, S. Guo, L. Cai, R. Gutierrez, B. Campbel, L. E. Barnes, and M. Boukhechba, “Graph neural networks in iot: a survey,” ACM Transactions on Sensor Networks , vol. 19, no. 2, pp. 1–50, 2023
2023
Closest in time.
M. Nie, D. Chen, and D. Wang, “Reinforcement learning on graphs: A survey,” IEEE Transactions on Emerging Topics in Computational Intelligence , 2023
2023
Closest in time.