Exploring Scholarly Data by Semantic Query on Knowledge Graph Embedding Space
Not on the map. Why?
Abstract (arXiv)
The trends of open science have enabled several open scholarly datasets which include millions of papers and authors. Managing, exploring, and utilizing such large and complicated datasets effectively are challenging. In recent years, the knowledge graph has emerged as a universal data format for representing knowledge about heterogeneous entities and their relationships. The knowledge graph can be modeled by knowledge graph embedding methods, which represent entities and relations as embedding vectors in semantic space, then model the interactions between these embedding vectors. However, the semantic structures in the knowledge graph embedding space are not well-studied, thus knowledge graph embedding methods are usually only used for knowledge graph completion but not data representation and analysis. In this paper, we propose to analyze these semantic structures based on the well-studied word embedding space and use them to support data exploration. We also define the semantic queries, which are algebraic operations between the embedding vectors in the knowledge graph embedding space, to solve queries such as similarity and analogy between the entities on the original datasets. We then design a general framework for data exploration by semantic queries and discuss the solution to some traditional scholarly data exploration tasks. We also propose some new interesting tasks that can be solved based on the uncanny semantic structures of the embedding space.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 1; 2025: 1.
5 papers.
- 2021Trans4E: Link Prediction on Scholarly Knowledge Graphscited by 13
- 2022MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Predictioncited by 4
- 2023EXTRACT: Explainable Transparent Control of Bias in Embeddingscited by 2
- 2025ADKGD: Anomaly Detection in Knowledge Graphs with Dual-Channel Trainingcited by 2
- 2024Revisiting Bi-Encoder Neural Search: An Encoding--Searching Separation Perspectivecited by 0
- 2025ADKGD: Anomaly Detection in Knowledge Graphs with Dual-Channel Training13 Jan 2025
- 2024Revisiting Bi-Encoder Neural Search: An Encoding--Searching Separation Perspective2 Aug 2024
- 2023EXTRACT: Explainable Transparent Control of Bias in Embeddings31 Oct 2023
- 2022MEIM: Multi-partition Embedding Interaction Beyond Block Term Format for Efficient and Expressive Link Prediction30 Sep 2022
- 2021Trans4E: Link Prediction on Scholarly Knowledge Graphs3 Jul 2021