Intent-Driven Semantic Query: An Effective Approach for Temporal Knowledge Graph Query

The temporal knowledge graph (TKG) query facilitates the retrieval of potential answers by parsing questions that incorporate temporal constraints, regarded as a vital downstream task in the broader spectrum of the TKG applications. Currently, enhancing the accuracy of the queries and the user experience has become a focal point for researchers. Existing query methods of the TKG aim to execute unambiguous standard query statements to return query results while neglecting the potential ambiguity in user input queries. To overcome this problem, in this paper, we propose a semantic query model for temporal knowledge graphs, TKGSQ-PM (Temporal Knowledge Graph Semantic Query based on Pre-trained Model). This model first identifies and extracts entity and temporal information from temporal knowledge graph queries and obtains corresponding temporal knowledge graph embedding information based on embedding methods. Then, it utilizes the pre-trained model DistilBERT to infer the true query intent from user input queries. Finally, it performs comprehensive sorting to return highquality query results. We conduct multiple experiments on three different datasets to demonstrate the efficiency and effectiveness of the proposed methods. Experimental results indicate that the TKGSQ-PM model has an overall advantage over baseline models in terms of query effectiveness and efficiency.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Big Data
Published
2025-08-19
DOI
https://doi.org/10.1109/tbdata.2025.3600035
Primary Topic
Semantic Web and Ontologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Intent-Driven Semantic Query: An Effective Approach for Temporal Knowledge Graph Query

Luyi Bai, Lin Zhu, Juan Dong
IEEE Transactions on Big Data
Semantic Web and Ontologies
article

Intent-Driven Semantic Query: An Effective Approach for Temporal Knowledge Graph Query

Luyi Bai, Lin Zhu, Juan Dong
article en

Abstract

The temporal knowledge graph (TKG) query facilitates the retrieval of potential answers by parsing questions that incorporate temporal constraints, regarded as a vital downstream task in the broader spectrum of the TKG applications. Currently, enhancing the accuracy of the queries and the user experience has become a focal point for researchers. Existing query methods of the TKG aim to execute unambiguous standard query statements to return query results while neglecting the potential ambiguity in user input queries. To overcome this problem, in this paper, we propose a semantic query model for temporal knowledge graphs, TKGSQ-PM (Temporal Knowledge Graph Semantic Query based on Pre-trained Model). This model first identifies and extracts entity and temporal information from temporal knowledge graph queries and obtains corresponding temporal knowledge graph embedding information based on embedding methods. Then, it utilizes the pre-trained model DistilBERT to infer the true query intent from user input queries. Finally, it performs comprehensive sorting to return highquality query results. We conduct multiple experiments on three different datasets to demonstrate the efficiency and effectiveness of the proposed methods. Experimental results indicate that the TKGSQ-PM model has an overall advantage over baseline models in terms of query effectiveness and efficiency.

IEEE Transactions on Big DataVol. 12(1)
Northeastern University (CN)
Openalex Percentile: Top 89%
Semantic Web and Ontologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.