Probability Calibration for Knowledge Graph Embedding Models
원문 초록
Knowledge graph embedding research has overlooked the problem of probability calibration. We show popular embedding models are indeed uncalibrated. That means probability estimates associated to predicted triples are unreliable. We present a novel method to calibrate a model when ground truth negatives are not available, which is the usual case in knowledge graphs. We propose to use Platt scaling and isotonic regression alongside our method. Experiments on three datasets with ground truth negatives show our contribution leads to well-calibrated models when compared to the gold standard of using negatives. We get significantly better results than the uncalibrated models from all calibration methods. We show isotonic regression offers the best the performance overall, not without trade-offs. We also show that calibrated models reach state-of-the-art accuracy without the need to define relation-specific decision thresholds.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs
Injecting Knowledge Graphs into Large Language Models
Embedding-Based Entity Alignment Using Relation Structural Similarity
Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation
Knowledge Graph Embedding via Graph Attenuated Attention Networks
ETT-CKGE: Efficient Task-driven Tokens for Continual Knowledge Graph Embedding
토론
이 논문과 연결된 포럼 글이 아직 없습니다.