{"url":"/method/netmf","slug":"netmf","name":"NetMF","full_name":"Network Embedding as Matrix Factorization:","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec","paper":"/paper/network-embedding-as-matrix-factorization","first_author":"Jiezhong Qiu","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/network-embedding-as-matrix-factorization"},"source":{"url":"http://arxiv.org/abs/1710.02971v4","title":"Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":3,"archive_num_papers":3,"papers_newest_first":[{"paper":null,"title":"Learning Large-scale Network Embedding from Representative Subgraph","date":"2021-12-02","arxiv_id":"2112.01442","n_code_links":0,"syntology":null},{"paper":"/paper/network-representation-learning-consolidation","title":"Network Representation Learning: Consolidation and Renewed Bearing","date":"2019-05-02","arxiv_id":"1905.00987","n_code_links":1,"syntology":null},{"paper":"/paper/network-embedding-as-matrix-factorization","title":"Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec","date":"2017-10-09","arxiv_id":"1710.02971","n_code_links":4,"syntology":{"ran":3,"of":3,"unverified":0,"pointer_only":0}}],"papers_shown":3,"tasks":[{"task":"/task/network-embedding","name":"Network Embedding","papers":2},{"task":"/task/representation-learning","name":"Representation Learning","papers":2},{"task":"/task/dimensionality-reduction","name":"Dimensionality Reduction","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/graph-sampling","name":"Graph Sampling","papers":1},{"task":"/task/link-prediction","name":"Link Prediction","papers":1},{"task":"/task/node-classification","name":"Node Classification","papers":1}],"tasks_shown":7,"n_tasks":7,"usage_by_year":[{"year":"2017","papers":1},{"year":"2019","papers":1},{"year":"2021","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/netmf"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}