GraRep: Learning graph representations with global structural information

International Conference on Information and Knowledge Management, Proceedings

Volumn 19-23-Oct-2015, Issue , 2015, Pages 891-900

  Cao, Shaosheng ^a   Lu, Wei ^b   Xu, Qiongkai ^c,d  

^a XIDIAN UNIVERSITY   (China)

^b SINGAPORE UNIVERSITY OF TECHNOLOGY AND DESIGN   (Singapore)

^c IBM RESEARCH   (United States)

^d AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Dimension reduction; Feature learning; Graph representation; Matrix factorization

Indexed keywords

FACTORIZATION; KNOWLEDGE MANAGEMENT;

DIMENSION REDUCTION; FEATURE LEARNING; GLOBAL REPRESENTATION; GRAPH REPRESENTATION; LANGUAGE NETWORKS; MATRIX FACTORIZATIONS; STATE-OF-THE-ART METHODS; STRUCTURAL INFORMATION;

GRAPH THEORY;

EID: 84958239002     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2806416.2806512     Document Type: Conference Paper

References (31)

1. A. Ahmed, N. Shervashidze, S. Narayanamurthy, V. Josifovski, and A. J. Smola. Distributed large-scale natural graph factorization. In WWW, pages 37-48. International World Wide Web Conferences Steering Committee, 2013.
2. D. Arthur and S. Vassilvitskii. k-means++: The advantages of careful seeding. In SODA, pages 1027-1035. Society for Industrial and Applied Mathematics, 2007.
3. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. In NIPS, volume 14, pages 585-591, 2001.
4. J. A. Bullinaria and J. P. Levy. Extracting semantic representations from word co-occurrence statistics: A computational study. BRM, 39(3):510-526, 2007.
5. J. A. Bullinaria and J. P. Levy. Extracting semantic representations from word co-occurrence statistics: stop-lists, stemming, and svd. BRM, 44(3):890-907, 2012.
6. J. Caron. Experiments with lsa scoring: Optimal rank and basis. In CIR, pages 157-169, 2001.
7. P. Comon. Independent component analysis, a new concept? Signal processing, 36(3):287-314, 1994.
8. T. F. Cox and M. A. Cox. Multidimensional scaling. CRC Press, 2000.
9. C. Eckart and G. Young. The approximation of one matrix by another of lower rank. Psychometrika, 1(3):211-218, 1936.
10. R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin. Liblinear: A library for large linear classification. JMLR, 9:1871-1874, 2008.
11. M. U. Gutmann and A. Hyvärinen. Noise-contrastive estimation of unnormalized statistical models, with applications to natural image statistics. JMLR, 13(1):307-361, 2012.
12. G. E. Hinton and R. R. Salakhutdinov. Reducing the dimensionality of data with neural networks. Science, 313(5786):504-507, 2006.
13. C. Jutten and J. Herault. Blind separation of sources, part i: An adaptive algorithm based on neuromimetic architecture. Signal processing, 24(1):1-10, 1991.
14. V. Klema and A. J. Laub. The singular value decomposition: Its computation and some applications. Automatic Control, 25(2):164-176, 1980.
15. T. K. Landauer, P. W. Foltz, and D. Laham. An introduction to latent semantic analysis. Discourse processes, 25(2-3):259-284, 1998.
16. O. Levy and Y. Goldberg. Neural word embedding as implicit matrix factorization. In NIPS, pages 2177-2185, 2014.
17. K. Lund and C. Burgess. Producing high-dimensional semantic spaces from lexical co-occurrence. BRMIC, 28(2):203-208, 1996.
18. T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean. Distributed representations of words and phrases and their compositionality. In NIPS, pages 3111-3119, 2013.
19. J. Pennington, R. Socher, and C. D. Manning. Glove: Global vectors for word representation. EMNLP, 12, 2014.
20. B. Perozzi, R. Al-Rfou, and S. Skiena. Deepwalk: Online learning of social representations. In SIGKDD, pages 701-710. ACM, 2014.
21. S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323-2326, 2000.
22. B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Incremental singular value decomposition algorithms for highly scalable recommender systems. In ICIS, pages 27-28. Citeseer, 2002.
23. J. Shi and J. Malik. Normalized cuts and image segmentation. PAMI, 22(8):888-905, 2000.
24. A. Strehl, J. Ghosh, and R. Mooney. Impact of similarity measures on web-page clustering. In Workshop on Artificial Intelligence for Web Search (AAAI 2000), pages 58-64, 2000.
25. J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei. Line: Large-scale information network embedding. In WWW. ACM, 2015.
26. J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su. Arnetminer: extraction and mining of academic social networks. In SIGKDD, pages 990-998. ACM, 2008.
27. L. Tang and H. Liu. Relational learning via latent social dimensions. In SIGKDD, pages 817-826. ACM, 2009.
28. J. B. Tenenbaum, V. De Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323, 2000.
29. F. Tian, B. Gao, Q. Cui, E. Chen, and T.-Y. Liu. Learning deep representations for graph clustering. In AAAI, 2014.
30. P. D. Turney. Domain and function: A dual-space model of semantic relations and compositions. JAIR, pages 533-585, 2012.
31. L. Van der Maaten and G. Hinton. Visualizing data using t-sne. JMLR, 9(2579-2605):85, 2008.