https://github.com/duong18/BiasedWalk
BiasedWalk: Biased Sampling for Representation Learning on Graphs
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
Network Embedding, also known as "Network Representation Learning", is a collective term for techniques for mapping graph nodes to vectors of real numbers in a multidimensional space. To be useful, a good embedding should preserve the structure of the graph. The vectors can then be used as input to various network and graph analysis tasks, such as link prediction
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
BiasedWalk: Biased Sampling for Representation Learning on Graphs
Fast and Accurate Network Embeddings via Very Sparse Random Projection
LNEMLC: Label Network Embeddings for Multi-Label Classification
Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning
mvn2vec: Preservation and Collaboration in Multi-View Network Embedding
Data driven approximation of parametrized PDEs by Reduced Basis and Neural Networks
Is a Single Vector Enough? Exploring Node Polysemy for Network Embedding
Temporal Network Representation Learning via Historical Neighborhoods Aggregation
mvn2vec: Preservation and Collaboration in Multi-View Network Embedding
struc2vec: Learning Node Representations from Structural Identity
Multiplex Bipartite Network Embedding using Dual Hypergraph Convolutional Networks
HiGitClass: Keyword-Driven Hierarchical Classification of GitHub Repositories
struc2vec: Learning Node Representations from Structural Identity
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.