arXiv:2110.13205
A Probabilistic Framework for Knowledge Graph Data Augmentation
원문 초록
We present NNMFAug, a probabilistic framework to perform data augmentation for the task of knowledge graph completion to counter the problem of data scarcity, which can enhance the learning process of neural link predictors. Our method can generate potentially diverse triples with the advantage of being efficient and scalable as well as agnostic to the choice of the link prediction model and dataset used. Experiments and analysis done on popular models and benchmarks show that NNMFAug can bring notable improvements over the baselines.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
GenIC: An LLM-Based Framework for Instance Completion in Knowledge Graphs
Context-Driven Knowledge Graph Completion with Semantic-Aware Relational Message Passing
Parallel Training of Knowledge Graph Embedding Models: A Comparison of Techniques
Knowledge Graph Embedding via Graph Attenuated Attention Networks
Learning Entity and Relation Embeddings for Knowledge Graph Completion
토론
이 논문과 연결된 포럼 글이 아직 없습니다.