arXiv:2204.04040
공식 코드 · Papers with Code
Ontology Matching Through Absolute Orientation of Embedding Spaces
원문 초록
Ontology matching is a core task when creating interoperable and linked open datasets. In this paper, we explore a novel structure-based mapping approach which is based on knowledge graph embeddings: The ontologies to be matched are embedded, and an approach known as absolute orientation is used to align the two embedding spaces. Next to the approach, the paper presents a first, preliminary evaluation using synthetic and real-world datasets. We find in experiments with synthetic data, that the approach works very well on similarly structured graphs; it handles alignment noise better than size and structural differences in the ontologies.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Systematic Evaluation of Knowledge Graph Embeddings for Gene-Disease Association Prediction
Corporate Fraud Detection in Rich-yet-Noisy Financial Graph
SparseTransX: Efficient Training of Translation-Based Knowledge Graph Embeddings Using Sparse Matrix Operations
PathE: Leveraging Entity-Agnostic Paths for Parameter-Efficient Knowledge Graph Embeddings
A Semantic Partitioning Method for Large-Scale Training of Knowledge Graph Embeddings
MEG: Medical Knowledge-Augmented Large Language Models for Question Answering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.