NetSMF enables scalable network embedding by applying spectral sparsification to produce a sparse approximation of the dense matrix implicitly factorized by methods such as DeepWalk.
Hamilton, Rex Ying, and Jure Leskovec
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization
NetSMF enables scalable network embedding by applying spectral sparsification to produce a sparse approximation of the dense matrix implicitly factorized by methods such as DeepWalk.