Confidential — Stefan Michaelcheck Only

A graph embedding-based dynamic update method for intelligence knowledge graphs

2026model innovationincrementalmethod

Yong Chen, Enhong Chen, Wenjie Liu, Nuo Chen, Xiaoning Wu, Tong Xu, Zhi Zheng

Frontiers of Computer Science

https://doi.org/10.1007/s11704-025-50326-yOpenAlex: W7126199243
1
URLs Found
0
Internal Citations
7
Authors
usable
Abstract Quality
GPT-5.5 Abstract Analysis

Problems Identified (2)

Dynamic KG update inaccuracy: Dynamic updating of intelligence knowledge graphs faces inaccuracy due to complex incremental data and noise interference.

Dynamic KG update inaccuracy: Dynamic updating of intelligence knowledge graphs faces inaccuracy due to complex incremental data and noise interference.

Proposed Solutions (5)

GEDUM graph embedding update: The paper proposes GEDUM, a graph embedding-based dynamic update method for intelligence knowledge graphs that models dynamic evolution and optimizes updating through embedding networks.

Local-to-global feature aggregation: The method includes L2GFAM to learn global graph embeddings by exploring and optimizing intrinsic node and edge features.

Attention-guided weighted fusion: The method includes AWFS to merge and update embeddings of local subgraphs and newly added graph components using correlations between new and existing data.

GEDUM graph embedding update: The paper proposes GEDUM, a graph embedding-based dynamic update method for intelligence knowledge graphs that models dynamic evolution and optimizes updating through embedding networks.

Local-to-global feature aggregation: The method includes L2GFAM to learn global graph embeddings by exploring and optimizing intrinsic node and edge features.

Results (2)

Superior dynamic update performance:

Superior dynamic update performance:

Research Domain

Intelligence knowledge graphs; dynamic knowledge graph updating; graph embeddings

← Back to all papers