Fetching the paper…
Reading the bibliography…
Most network data are collected from partially observable networks with both missing nodes and missing edges, for example, due to limited resources and privacy settings specified by users on social media.
P. Erdos and A. Rényi, “On random graphs I,” Publ. Math. Debrecen , vol. 6, pp. 290–297, 1959
1959
Earlier work this paper cites.
A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the em algorithm,” J. Royal Stat. Soc. Series B (Methodological) , vol. 39, no. 1, pp. 1–22, 1977
1977
Earlier work this paper cites.
A. Sanfeliu and K.-S. Fu, “A distance measure between attributed relational graphs for pattern recognition,” IEEE Trans. Syst. Man Cybernetics , vol. SMC-13, no. 3, pp. 353–362, Jun. 1983
1983
Earlier work this paper cites.
N. Linial, E. London, and Y. Rabinovich, “The geometry of graphs and some of its algorithmic applications,” Combinatorica , vol. 15, no. 2, pp. 215–245, 1995
1995
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural Comput. , vol. 9, no. 8, pp. 1735–1780, Nov. 1997
1997
Earlier work this paper cites.
A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science , vol. 286, no. 5439, pp. 509–512, Oct. 1999
1999
Earlier work this paper cites.
M. E. Newman, “Random graphs as models of networks,” Proc. National Acad. Sci. , vol. 99, no. 1, pp. 2566–2572, 2002
2002
Earlier work this paper cites.
P. D. Dobson and A. J. Doig, “Distinguishing enzyme structures from non-enzymes without alignments,” J. Molecular Bio. , vol. 330, no. 4, pp. 771–783, Jul. 2003
2003
Earlier work this paper cites.
G. Kossinets, “Effects of missing data in social networks,” Soc. Netw. , vol. 28, no. 3, pp. 247–268, Jul. 2006
2006
Earlier work this paper cites.
J. Leskovec and C. Faloutsos, “Sampling from large graphs,” in Proc. 12th ACM SIGKDD Int. Conf. Knowl. Disc. Data Mining (KDD ’06) , Philadelphia, PA, USA, Aug. 2006, pp. 631–636
2006
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI Magazine , vol. 29, no. 3, pp. 93–106, 2008
2008
Earlier work this paper cites.
J. P. Haldar and D. Hernando, “Rank-constrained solutions to linear matrix equations using powerfactorization,” IEEE Signal Process. Lett. , vol. 16, no. 7, pp. 584–587, Jul. 2009
2009
Earlier work this paper cites.
A. Lancichinetti and S. Fortunato, “Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities,” Phys. Rev. E , vol. 80, no. 1, pp. 016 118:1–016 118:8, Apr. 2009
2009
Earlier work this paper cites.
Z. Zeng, A. K. H. Tung, J. Wang, J. Feng, and L. Zhou, “Comparing stars: On approximating graph edit distance,” Proc. VLDB Endow. , vol. 2, no. 1, pp. 25–36, Aug. 2009
2009
Earlier work this paper cites.
J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani, “Kronecker graphs: An approach to modeling networks,” J. Mach. Learning Res. , vol. 11, pp. 985–1042, Feb. 2010
2010
Earlier work this paper cites.
P. Jain, R. Meka, and I. S. Dhillon, “Guaranteed rank minimization via singular value projection,” in Proc. Advances Neural Inf. Processing Syst. (NIPS ’10) , Vancouver, Canada, Dec. 2010, pp. 937–945
2010
Cited alongside, same era.
T. H. McCormick, M. J. Salganik, and T. Zheng, “How many people you know?: Efficiently esimating personal network size,” J. Am. Stat. Assoc. , vol. 105, no. 489, pp. 59–70, Sep. 2010
2010
Cited alongside, same era.
M. Kim and J. Leskovec, “The network completion problem: Inferring missing nodes and edges in networks,” in Proc. 2011 SIAM Int. Conf. Data Mining (SDM ’11) , Mesa, AZ, USA, Apr. 2011, pp. 47–58
2011
Cited alongside, same era.
A. L. Traud, E. D. Kelsic, P. J. Mucha, and M. A. Porter, “Comparing community structure to characteristics in online collegiate social networks,” SIAM Rev. , vol. 53, no. 3, pp. 526–543, Aug. 2011
2011
Cited alongside, same era.
2017
Later among the works it cites.
F. Monti, M. Bronstein, and X. Bresson, “Geometric matrix completion with recurrent multi-graph neural networks,” in Proc. Advances Neural Inf. Processing Syst. (NIPS ’17) , Long Beach, CA, Dec. 2017, pp. 3697–3707
2017
Later among the works it cites.
A. Fischer, K. Riesen, and H. Bunke, “Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment,” Pattern Recogn. Lett. , vol. 87, pp. 55–62, Feb. 2017
2017
Later among the works it cites.
J. You, R. Ying, X. Ren, W. Hamilton, and J. Leskovec, “GraphRNN: Generating realistic graphs with deep auto-regressive models,” in Proc. Int. Conf. Machine Learning (ICML ’18) , Stockholm, Sweden, Jul. 2018, pp. 5694–5703
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Lü and T. Zhou, “Link prediction in complex networks: A survey,” Phys. A: Stat. Mech. Appl. , vol. 390, no. 6, pp. 1150–1170, Mar. 2011
2011
Cited alongside, same era.
A. K. Menon and C. Elkan, “Link prediction via matrix factorization,” in Proc. European Conf. Machine Learning Knowl. Disc. Databases (ECML PKDD ’11) , Athens, Greece, Sep. 2011, pp. 437–452
2011
Cited alongside, same era.
R. Dey, Z. Jelveh, and K. Ross, “Facebook users have become much more private: A large-scale study,” in Proc. IEEE Int. Conf. Pervasive Comput. Commun. Worksh. , Lugano, Switzerland, Mar. 2012, pp. 346–352
2012
Cited alongside, same era.
J. H. Koskinen, G. L. Robins, P. Wang, and P. E. Pattison, “Bayesian analysis for partially observed network data, missing ties, attributes and actors,” Soc. Netw. , vol. 35, no. 4, pp. 514–527, Oct. 2013
2013
Cited alongside, same era.
S. Sina, A. Rosenfeld, and S. Kraus, “Solving the missing node problem using structure and attribute information,” in Proc. 2013 IEEE/ACM Int. Conf. Advances Social Netw. Analysis Mining (ASONAM ’13) , Niagara Falls, Canada, Aug. 2013, pp. 744–751
2013
Cited alongside, same era.
C. Gentile, S. Li, and G. Zappella, “Online clustering of bandits,” in Proc. Int. Conf. Machine Learning (ICML ’14) , Beijing, China, Jun. 2014, pp. 757–765
2014
Cited alongside, same era.
R. Eyal, A. Rosenfeld, S. Sina, and S. Kraus, “Predicting and identifying missing node information in social networks,” ACM Trans. Knowl. Disc. Data , vol. 8, no. 3, pp. 14:1–14:35, Jun. 2014
2014
Cited alongside, same era.
J. Chung, C. Gulcehre, K. Cho, and Y. Bengio, “Empirical evaluation of gated recurrent neural networks on sequence modeling,” in Proc. Deep Learning and Representation Learning Worksh. , Montreal, Canada, Dec. 2014
2014
Cited alongside, same era.
A. Bojchevski, O. Shchur, D. Zügner, and S. Günnemann, “NetGAN: Generating graphs via random walks,” in Proc. Int. Conf. Machine Learning (ICML ’18) , Stockholm, Sweden, Jul. 2018, pp. 609–618
2018
Later among the works it cites.
M. Simonovsky and N. Komodakis, “GraphVAE: Towards generation of small graphs using variational autoencoders,” in Proc. Int. Conf. Artificial Neural Netw. Machine Learning (ICANN ’18) , Rhodes, Greece, Oct. 2018, pp. 412–422
2018
Later among the works it cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” in NIPS Worksh. Bayesian Deep Learning , Montréal, Canada, Dec. 2018
2018
Later among the works it cites.
J. You, B. Liu, Z. Ying, V. Pande, and J. Leskovec, “Graph convolutional policy network for goal-directed molecular graph generation,” in Proc. Advances Neural Inf. Processing Syst. (NIPS ’18) , Montréal, Canada, Dec. 2018, pp. 6410–6421
2018
Later among the works it cites.
2018
Later among the works it cites.
M. Zhang and Y. Chen, “Link prediction based on graph neural networks,” in Proc. Advances Neural Inf. Processing Syst. (NIPS ’18) , Montreal, Canada, Dec. 2018, pp. 5165–5175
2018
Later among the works it cites.
R. Liao, Y. Li, Y. Song, S. Wang, W. Hamilton, D. K. Duvenaud, R. Urtasun, and R. Zemel, “Efficient graph generation with graph recurrent attention networks,” in Proc. Advances Neural Inf. Processing Syst. (NIPS ’19) , Vancouver, Canada, Dec. 2019, pp. 4257–4267
2019
Closest in time.
D. Zhou, L. Zheng, J. Xu, and J. He, “Misc-GAN: A multi-scale generative model for graphs,” Fronti. Big Data , vol. 2, pp. 3:1–3:10, Apr. 2019
2019
Closest in time.
K. Mahadik, Q. Wu, S. Li, and A. Sabne, “Fast distributed bandits for online recommendation systems,” in Proc. 34th Int. Conf. Supercomput. (ICS ’20) , Las Vegas, NV, Jun.-Jul. 2020, pp. 1–13
2020
Closest in time.
H. Park and M.-S. Kim, “EvoGraph: An effective and efficient graph upscaling method for preserving graph properties,” in Proc. 24th ACM SIGKDD Int. Conf. Knowl. Disc. Data Mining (KDD ’18) , London, United Kingdom, Aug. 2018, pp. 2051–2059
2059
Closest in time.