https://github.com/zyjcs/KGE-HAE
Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
The goal of Graph Representation Learning is to construct a set of features (‘embeddings’) representing the structure of the graph and the data thereon. We can distinguish among Node-wise embeddings, representing each node of the graph, Edge-wise embeddings, representing each edge in the graph, and Graph-wise embeddings representing the graph as a whole.
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction
Knowledge Graph Embedding for Ecotoxicological Effect Prediction
Hierarchical Graph Representation Learning with Differentiable Pooling
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.