Papers with Code 아카이브
Knowledge Base Completion
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
Knowledge base completion is the task which automatically infers missing facts by reasoning about the information already present in the knowledge base. A knowledge base is a collection of relational facts, often represented in the form of "subject", "relation", "object"-triples.
코드
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
https://github.com/dmlc/dgl/tree/master/examples/tensorflow/rgcn
https://github.com/giuseppefutia/semi
https://github.com/glorotxa/SME
Combining Two And Three-Way Embeddings Models for Link Prediction in Knowledge Bases
https://github.com/guillaumejaume/tuto-dl-on-graphs
https://github.com/hkiyomaru/pu-learning
https://github.com/kracr/document-level-relation-extraction
https://github.com/masakicktashiro/rgcn_pytorch_implementation
https://github.com/mniepert/mmkb
https://github.com/nec-research/dccg
https://github.com/parkererickson/crunchBaseGraph
https://github.com/pouyapez/multim-kb-embeddings
Embedding Multimodal Relational Data for Knowledge Base Completion
https://github.com/predict-idlab/RR-GCN
https://github.com/shijx12/kqapro_baselines
https://github.com/susurrant/flow-imputation
https://github.com/susurrant/spatial-interaction-modeling
https://github.com/thiviyanT/torch-rgcn
https://github.com/tkipf/gae
https://github.com/toooooodo/rgcn-linkprediction
https://github.com/twktheainur/kbc
Canonical Tensor Decomposition for Knowledge Base Completion
https://github.com/usherwang02/SemanticMatchingEnergy-Theano
Combining Two And Three-Way Embeddings Models for Link Prediction in Knowledge Bases
https://github.com/vincentschen/limited-label-scene-graphs
https://github.com/wliu88/AttentivePathRanking
https://github.com/yangyucheng000/Papers/tree/main/MindSpore-Retrieval-augmented
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.