The Forward-Backward Embedding of Directed Graphs
暂无分享,去创建一个
[1] Nathan Halko,et al. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..
[2] Jian Li,et al. Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec , 2017, WSDM.
[3] Kevin Chen-Chuan Chang,et al. A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications , 2017, IEEE Transactions on Knowledge and Data Engineering.
[4] Steven Skiena,et al. DeepWalk: online learning of social representations , 2014, KDD.
[5] J. Delvenne,et al. Random walks on graphs , 2004 .
[6] Ulrike von Luxburg,et al. A tutorial on spectral clustering , 2007, Stat. Comput..
[7] Jérôme Kunegis,et al. KONECT: the Koblenz network collection , 2013, WWW.
[8] François Fouss,et al. Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation , 2007, IEEE Transactions on Knowledge and Data Engineering.
[9] Peter G. Doyle,et al. Random Walks and Electric Networks: REFERENCES , 1987 .
[10] Marina Meila,et al. Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators , 2011, NIPS.
[11] Zhi-Li Zhang,et al. Commute Times for a Directed Graph using an Asymmetric Laplacian , 2011 .
[12] Inderjit S. Dhillon,et al. Co-clustering documents and words using bipartite spectral graph partitioning , 2001, KDD '01.
[13] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[14] Palash Goyal,et al. Graph Embedding Techniques, Applications, and Performance: A Survey , 2017, Knowl. Based Syst..
[15] Pierre Vandergheynst,et al. Geometric Deep Learning: Going beyond Euclidean data , 2016, IEEE Signal Process. Mag..
[16] Jure Leskovec,et al. node2vec: Scalable Feature Learning for Networks , 2016, KDD.
[17] M E J Newman,et al. Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[18] Bin Yu,et al. Co-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim , 2012, 1204.2296.
[19] Mikhail Belkin,et al. Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.
[20] Edwin R. Hancock,et al. Clustering and Embedding Using Commute Times , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[21] Stephen Lin,et al. Graph Embedding and Extensions: A General Framework for Dimensionality Reduction , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[22] Zhi-Li Zhang,et al. Random Walks on Digraphs, the Generalized Digraph Laplacian and the Degree of Asymmetry , 2010, WAW.
[23] Jon M. Kleinberg,et al. The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.