Fetching the paper…
Reading the bibliography…
In this work we propose Lasagne, a methodology to learn locality and structure aware graph node embeddings in an unsupervised way.
D. Knuth, “The art of computer programming: Vol 2/seminumerical algorithms, chapter 3: Random numbers,” 1969
1969
Earlier work this paper cites.
L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: bringing order to the web.” 1999
1999
Earlier work this paper cites.
J. B. Tenenbaum, V. De Silva, and J. C. Langford, “A global geometric framework for nonlinear dimensionality reduction,” science , vol. 290, no. 5500, pp. 2319–2323, 2000
2000
Earlier work this paper cites.
S. T. Roweis and L. K. Saul, “Nonlinear dimensionality reduction by locally linear embedding,” Science , vol. 290, no. 5500, pp. 2323–2326, 2000
2000
Earlier work this paper cites.
M. Belkin and P. Niyogi, “Laplacian eigenmaps and spectral techniques for embedding and clustering.” in NIPS , vol. 14, 2001, pp. 585–591
2001
Earlier work this paper cites.
G. Jeh and J. Widom, “Scaling personalized web search,” in Proc. of the 12th WWW . ACM, 2003, pp. 271–279
2003
Earlier work this paper cites.
S. Yan, D. Xu, B. Zhang, and H.-J. Zhang, “Graph embedding: A general framework for dimensionality reduction,” in Proc. of IEEE CVPR , vol. 2. IEEE, 2005, pp. 830–837
2005
Earlier work this paper cites.
R. Andersen, F. Chung, and K. Lang, “Local graph partitioning using pagerank vectors,” in Proc. of the 47th IEEE FOCS . IEEE, 2006, pp. 475–486
2006
Earlier work this paper cites.
P. Berkhin, “Bookmark-coloring algorithm for personalized pagerank computing,” Internet Mathematics , vol. 3, no. 1, pp. 41–62, 2006
2006
Earlier work this paper cites.
D. Liben-Nowell and J. Kleinberg, “The link-prediction problem for social networks,” journal of the Association for Information Science and Technology , vol. 58, no. 7, pp. 1019–1031, 2007
2007
Earlier work this paper cites.
L. v. d. Maaten and G. Hinton, “Visualizing data using t-sne,” Journal of Machine Learning Research , vol. 9, no. Nov, pp. 2579–2605, 2008
2008
Earlier work this paper cites.
J. Leskovec, K. Lang, A. Dasgupta, and M. W. Mahoney, “Statistical properties of community structure in large social and information networks,” in WWW ’08: Proceedings of the 17th International Conference on World Wide Web , 2008, pp. 695–704
2008
Earlier work this paper cites.
B.-J. Breitkreutz, C. Stark, T. Reguly, L. Boucher, A. Breitkreutz, M. Livstone, R. Oughtred, D. H. Lackner, J. Bähler, V. Wood et al. , “The biogrid interaction database: 2008 update,” Nucleic acids research , vol. 36, no. suppl 1, pp. D637–D640, 2008
2008
Earlier work this paper cites.
J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, “Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters,” Internet Mathematics , vol. 6, no. 1, pp. 29–123, 2009
2009
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Transactions on Neural Networks , vol. 20, no. 1, pp. 61–80, 2009
2009
Cited alongside, same era.
L. Tang and H. Liu, “Relational learning via latent social dimensions,” in Proc. of the 15th ACM SIGKDD . ACM, 2009, pp. 817–826
2009
Cited alongside, same era.
J. Leskovec, K. Lang, and M. W. Mahoney, “Empirical comparison of algorithms for network community detection,” in WWW ’10: Proceedings of the 19th International Conference on World Wide Web , 2010, pp. 631–640
2010
Cited alongside, same era.
C. C. Aggarwal, “An introduction to social network data analytics,” in Social network data analytics . Springer, 2011, pp. 1–15
2011
Cited alongside, same era.
S. Bhagat, G. Cormode, and S. Muthukrishnan, “Node classification in social networks,” in Social network data analytics . Springer, 2011, pp. 115–148
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “Line: Large-scale information network embedding,” in Proc. of the 24th WWW . ACM, 2015, pp. 1067–1077
2015
Later among the works it cites.
L. G. Jeub, P. Balachandran, M. A. Porter, P. J. Mucha, and M. W. Mahoney, “Think locally, act locally: Detection of small, medium-sized, and large communities in large networks,” Physical Review E , vol. 91, no. 1, p. 012821, 2015
2015
Later among the works it cites.
S. Cao, W. Lu, and Q. Xu, “Grarep: Learning graph representations with global structural information,” in Proceedings of the 24th ACM International on Conference on Information and Knowledge Management . ACM, 2015, pp. 891–900
2015
Later among the works it cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proc. of the 22nd ACM SIGKDD , 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…
2011
Cited alongside, same era.
A. B. Adcock, B. D. Sullivan, and M. W. Mahoney, “Tree-like structure in large social and information networks,” in Proc. of the 2013 IEEE ICDM , 2013, pp. 1–10
2013
Cited alongside, same era.
2013
Cited alongside, same era.
J. Shun and G. E. Blelloch, “Ligra: a lightweight graph processing framework for shared memory,” in ACM SIGPLAN Notices , vol. 48, no. 8. ACM, 2013, pp. 135–146
2013
Cited alongside, same era.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proc. of the 20th ACM SIGKDD , 2014, pp. 701–710
2014
Cited alongside, same era.
K. Li, J. Gao, S. Guo, N. Du, X. Li, and A. Zhang, “Lrbm: A restricted boltzmann machine based approach for representation learning on linked data,” in Proc. of IEEE ICDM . IEEE, 2014, pp. 300–309
2014
Cited alongside, same era.
F. Tian, B. Gao, Q. Cui, E. Chen, and T.-Y. Liu, “Learning deep representations for graph clustering.” in AAAI , 2014, pp. 1293–1299
2014
Cited alongside, same era.
Q. V. Le and T. Mikolov, “Distributed representations of sentences and documents.” in ICML , vol. 14, 2014, pp. 1188–1196
2014
Cited alongside, same era.
——, “Tree decompositions and social graphs,” Internet Mathematics , vol. 12, no. 5, pp. 315–361, 2016
2016
Later among the works it cites.
J. Shun, F. Roosta-Khorasani, K. Fountoulakis, and M. W. Mahoney, “Parallel local graph clustering,” Proc. VLDB Endow. , vol. 9, no. 12, pp. 1041–1052, Aug. 2016. [Online]. Available: http://dx.doi.org/10.14778/2994509.2994522
2016
Later among the works it cites.
Z. Yang, W. Cohen, and R. Salakhudinov, “Revisiting semi-supervised learning with graph embeddings,” in Proc. of The 33rd ICDM , 2016, pp. 40–48
2016
Later among the works it cites.
Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel, “Gated graph sequence neural networks,” in ICLR , 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
IMDb, “The internet movie database,” in http://www.imdb.com/ , 2016, last accessed: 2016-11-22
2016
Later among the works it cites.
M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving, M. Isard et al. , “Tensorflow: A system for large-scale machine learning,” in Proc. of the 12th USENIX OSDI. Savannah, Georgia, USA , 2016
2016
Later among the works it cites.
A. Gittens, D. Achlioptas, and M. W. Mahoney, “Skip-gram-zipf+ uniform= vector additivity,” in Proc. of ACL , vol. 1, 2017, pp. 69–76
2017
Closest in time.