https://bitbucket.org/sdumancic/embeddingsmeetilp
공식 코드A Comparative Study of Distributional and Symbolic Paradigms for Relational Learning
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
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.
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
A Comparative Study of Distributional and Symbolic Paradigms for Relational Learning
Lossless Compression of Structured Convolutional Models via Lifting
Lossless Compression of Structured Convolutional Models via Lifting
End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion
Modeling Relation Paths for Representation Learning of Knowledge Bases
Modeling relation paths for knowledge base completion via joint adversarial training
Revisiting Simple Neural Networks for Learning Representations of Knowledge Graphs
Interpreting Embedding Models of Knowledge Bases: A Pedagogical Approach
Knowledge Base Completion for Constructing Problem-Oriented Medical Records
DELE: Deductive $\mathcal{EL}^{++} \thinspace $ Embeddings for Knowledge Base Completion
Lattice-preserving $\mathcal{ALC}$ ontology embeddings with saturation
Do LLMs Really Adapt to Domains? An Ontology Learning Perspective
ZeroKBC: A Comprehensive Benchmark for Zero-Shot Knowledge Base Completion
Explaining Neural Matrix Factorization with Gradient Rollback
A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network
Joint Matrix-Tensor Factorization for Knowledge Base Inference
mOKB6: A Multilingual Open Knowledge Base Completion Benchmark
Temporal Knowledge Base Completion: New Algorithms and Evaluation Protocols
STransE: a novel embedding model of entities and relationships in knowledge bases
Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs
Canonical Tensor Decomposition for Knowledge Base Completion
Tensor Decompositions for temporal knowledge base completion
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion
Robust and Efficient Imbalanced Positive-Unlabeled Learning with Self-supervision
BERTnesia: Investigating the capture and forgetting of knowledge in BERT
Time in a Box: Advancing Knowledge Graph Completion with Temporal Scopes
Ranking vs. Classifying: Measuring Knowledge Base Completion Quality
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.