Approximating Probabilistic Inference in Statistical EL with Knowledge Graph Embeddings
<|reference_start|>Approximating Probabilistic Inference in Statistical EL with Knowledge Graph Embeddings: Statistical information is ubiquitous but drawing valid conclusions from it is prohibitively hard. We explain how knowledge graph embeddings can be used to approximate probabilistic inference efficiently using the example of Statistical EL (SEL), a statistical extension of the lightweight Description Logic EL. We provide proofs for runtime and soundness guarantees, and empirically evaluate the runtime and approximation quality of our approach.<|reference_end|>
@article{zhu2024approximating,
    title={Approximating Probabilistic Inference in Statistical EL with Knowledge
  Graph Embeddings},
    author={Yuqicheng Zhu, Nico Potyka, Bo Xiong, Trung-Kien Tran, Mojtaba
  Nayyeri, Evgeny Kharlamov, Steffen Staab},
    journal={arXiv preprint arXiv:2407.11821},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.11821},
    primaryClass={cs.AI}
}