Fetching the paper…
Reading the bibliography…
Deep neural network has shown remarkable performance in solving computer vision and some graph evolved tasks, such as node classification and link prediction.
L. Katz, “A new status index derived from sociometric analysis,” Psychometrika , vol. 18, no. 1, pp. 39–43, 1953
1953
Earlier work this paper cites.
D. Lin, “An information-theoretic definition of similarity,” in International Conference on Machine Learning , 1998, pp. 296–304
1998
Earlier work this paper cites.
M. Craven, D. Dipasquo, D. Freitag, A. Mccallum, T. Mitchell, K. Nigam, and S. Slattery, “Learning to extract symbolic knowledge from the world wide web,” in Proc. of the National Conference on Artificial Intelligence , 1998, pp. 121–126
1998
Earlier work this paper cites.
J. M. Montoya and R. V. Sol, “Small world patterns in food webs.” Journal of Theoretical Biology , vol. 214, no. 3, pp. 405–412, 2002
2002
Earlier work this paper cites.
H. Ebel, L. I. Mielsch, and S. Bornholdt, “Scale-free topology of e-mail networks,” Phys Rev E Stat Nonlin Soft Matter Phys , vol. 66, no. 3 Pt 2A, p. 035103, 2002
2002
Earlier work this paper cites.
V. Latora and M. Marchiori, “Is the boston subway a small-world network?” Physica A Statistical Mechanics & Its Applications , vol. 314, no. 1, pp. 109–113, 2002
2002
Earlier work this paper cites.
M. C. Von, R. Krause, B. Snel, M. Cornell, S. G. Oliver, S. Fields, and P. Bork, “Comparative assessment of large-scale data sets of protein-protein interactions.” Nature , vol. 417, no. 6887, pp. 399–403, 2002
2002
Earlier work this paper cites.
D. Liben‐Nowell and J. Kleinberg, “The link‐prediction problem for social networks,” 2003, pp. 556–559
2003
Earlier work this paper cites.
A. Popescul, “Statistical relational learning for link prediction,” in Proc. IJCAI Workshop on Learning Statistical MODELS From Relational Data , 2003
2003
Earlier work this paper cites.
B. Wellman, “The development of social network analysis: A study in the sociology of science by linton c. freeman,” Social Networks , vol. 27, no. 3, pp. 275–282, 2005
2005
Earlier work this paper cites.
Z. Huang, “Link prediction approach to collaborative filtering,” pp. 141–142, 2005
2005
Earlier work this paper cites.
M. E. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical Review E Statistical Nonlinear & Soft Matter Physics , vol. 74, no. 3 Pt 2, p. 036104, 2006
2006
Earlier work this paper cites.
M. Bilgic, G. M. Namata, and L. Getoor, “Combining collective classification and link prediction,” in IEEE International Conference on Data Mining Workshops, 2007. ICDM Workshops , 2007, pp. 381–386
2007
Earlier work this paper cites.
T. Zhou, J. Ren, M. Medo, and Y. C. Zhang, “Bipartite network projection and personal recommendation.” Physical Review E Statistical Nonlinear & Soft Matter Physics , vol. 76, no. 2, p. 046115, 2007
2007
Earlier work this paper cites.
J. W. Neal, “”kracking” the missing data problem: Applying krackhardt’s cognitive social structures to school-based social networks,” Sociology of Education , vol. 81, no. 2, pp. 140–162, 2008
2008
Earlier work this paper cites.
H. Bunke and K. Riesen, “Graph classification based on dissimilarity space embedding,” in Joint Iapr International Workshop on Structural, Syntactic, and Statistical Pattern Recognition , 2008, pp. 996–1007
2008
Earlier work this paper cites.
E. Zheleva and L. Getoor, “Preserving the privacy of sensitive relationships in graph data,” in Privacy, security, and trust in KDD . Springer, 2008, pp. 153–171
2008
Earlier work this paper cites.
S. P. Borgatti, A. Mehra, D. J. Brass, and G. Labianca, “Network analysis in the social sciences,” Science , vol. 323, no. 5916, pp. 892–895, 2009
2009
Cited alongside, same era.
R. Guimerà and M. Salespardo, “Missing and spurious interactions and the reconstruction of complex networks,” Proceedings of the National Academy of Sciences of the United States of America , vol. 106, no. 52, pp. 22 073–22 078, 2009
2009
Cited alongside, same era.
T. Zhou, L. Lü, and Y. C. Zhang, “Predicting missing links via local information,” European Physical Journal B , vol. 71, no. 4, pp. 623–630, 2009
2009
Cited alongside, same era.
W. Liu and L. Lu, “Link prediction based on local random walk,” vol. 89, no. 5, pp. 58 007–58 012(6), 2010
2010
Cited alongside, same era.
K. Riesen and H. Bunke, “Graph classification and clustering based on vector space embedding,” vol. Volume 77, p. 348, 2010
J. Tang, M. Qu, and Q. Mei, “Pte: Predictive text embedding through large-scale heterogeneous text networks,” in ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2015, pp. 1165–1174
2015
Later among the works it cites.
A. M. Fard and K. Wang, “Neighborhood randomization for link privacy in social network analysis,” World Wide Web , vol. 18, no. 1, pp. 9–32, 2015
2015
Later among the works it cites.
A. Anil, D. Kumar, S. Sharma, R. Singha, R. Sarmah, N. Bhattacharya, and S. R. Singh, “Link prediction using social network analysis over heterogeneous terrorist network,” in IEEE International Conference on Smart City/socialcom/sustaincom , 2016, pp. 267–272
2016
Later among the works it cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2016, pp. 855–864
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
S. Nagaraja, “The impact of unlinkability on adversarial community detection: effects and countermeasures,” in International Symposium on Privacy Enhancing Technologies Symposium . Springer, 2010, pp. 253–272
2010
Cited alongside, same era.
X. Glorot and Y. Bengio, “Understanding the difficulty of training deep feedforward neural networks,” Journal of Machine Learning Research , vol. 9, pp. 249–256, 2010
2010
Cited alongside, same era.
L. Lü and T. Zhou, “Link prediction in complex networks: A survey,” Physica A Statistical Mechanics & Its Applications , vol. 390, no. 6, pp. 1150–1170, 2011
2011
Cited alongside, same era.
X. Yang, Z. Zhang, and K. Wang, “Scalable collaborative filtering using incremental update and local link prediction,” in Proceedings of the 21st ACM international conference on Information and knowledge management . ACM, 2012, pp. 2371–2374
2012
Cited alongside, same era.
A. M. Fard, K. Wang, and P. S. Yu, “Limiting link disclosure in social network analysis through subgraph-wise perturbation,” in Proceedings of the 15th International Conference on Extending Database Technology . ACM, 2012, pp. 109–119
2012
Cited alongside, same era.
J. Mcauley and J. Leskovec, “Learning to discover social circles in ego networks,” in International Conference on Neural Information Processing Systems , 2012, pp. 539–547
2012
Cited alongside, same era.
T. Mikolov, K. Chen, G. Corrado, and J. Dean, “Efficient estimation of word representations in vector space,” Computer Science , 2013
2013
Cited alongside, same era.
S. Wang, J. Tang, C. Aggarwal, and H. Liu, “Linked document embedding for classification,” in CIKM , 2016
2016
Later among the works it cites.
K. Allab, L. Labiod, and M. Nadif, “A semi-nmf-pca unified framework for data clustering,” IEEE Transactions on Knowledge & Data Engineering , vol. 29, no. 1, pp. 2–16, 2016
2016
Later among the works it cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” 2016
2016
Later among the works it cites.
S. M. Moosavidezfooli, A. Fawzi, and P. Frossard, “Deepfool: A simple and accurate method to fool deep neural networks,” in Computer Vision and Pattern Recognition , 2016, pp. 2574–2582
2016
Later among the works it cites.
2016
Later among the works it cites.
J. Chen, Y. Wu, L. Fan, X. Lin, H. Zheng, S. Yu, and Q. Xuan, “Improved spectral clustering collaborative filtering with node2vec technology,” in Complex Systems and Networks (IWCSN), 2017 International Workshop on . IEEE, 2017, pp. 330–334
2017
Later among the works it cites.
J. Chen, X. Lin, Y. Wu, Y. Chen, H. Zheng, M. Su, S. Yu, and Z. Ruan, “Double layered recommendation algorithm based on fast density clustering: Case study on yelp social networks dataset,” in Complex Systems and Networks (IWCSN), 2017 International Workshop on . IEEE, 2017, pp. 242–252
2017
Later among the works it cites.
M. Schlichtkrull, T. N. Kipf, P. Bloem, R. V. D. Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” 2017
2017
Later among the works it cites.
M. Waniek, T. P. Michalak, M. J. Wooldridge, and T. Rahwan, “Hiding individuals and communities in a social network,” Nature Human Behaviour , vol. 2, no. 2, p. 139, 2018
2018
Closest in time.
D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial attacks on neural networks for graph data,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2018, London, UK, August 19-23, 2018 , 2018, pp. 2847–2856
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.