What is recorded here?
Relates random-walk/negative-sampling embedding objectives to graph matrix factorizations and computes clipped log co-occurrence embeddings directly or with spectral approximation.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
Original derivation assumes connected undirected non-bipartite graphs and stationary starts or a long-walk limit, together with inherited idealized SGNS factorization. Finite samples, low-rank embeddings and nonconvex training are not literally identical to the population optimum. NetMF truncates/clips its matrix and approximates large windows; general method only, bio application results omitted.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Jiezhong Qiu; Yuxiao Dong; Hao Ma; Jian Li; Kuansan Wang; Jie Tang
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
NetMF matrix-factorization view of network embeddings
Relates random-walk/negative-sampling embedding objectives to graph matrix factorizations and computes clipped log co-occurrence embeddings directly or with spectral approximation.
Scientific scope
Original derivation assumes connected undirected non-bipartite graphs and stationary starts or a long-walk limit, together with inherited idealized SGNS factorization. Finite samples, low-rank embeddings and nonconvex training are not literally identical to the population optimum. NetMF truncates/clips its matrix and approximates large windows; general method only, bio application results omitted.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Jiezhong Qiu; Yuxiao Dong; Hao Ma; Jian Li; Kuansan Wang; Jie Tang
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.