Journal of Jilin University (Information Science Edition) ›› 2025, Vol. 43 ›› Issue (5): 1119-1127.

Previous Articles     Next Articles

Algorithm for Extracting Entity Relationships from Knowledge Graph of Academic Text Keyword Library

WANG Zhe1,2, LIU Huan3, LIANG Peiwei3   

  1. 1. School of Computer Science and Engineering, South China University of Technology, Guangzhou 510000, China; 2. China Southern Power Grid Company Limited, Guangzhou 510663, China; 3. Southern Power Grid Digital Enterprise Technology Guangdong Company Limited, Guangzhou 510030, China
  • Received:2023-11-16 Online:2025-09-28 Published:2025-11-20

Abstract:  In order to quickly extract key information from massive library knowledge graphs, an entity relationship extraction algorithm for academic text keyword library knowledge graphs is proposed. OCS-FCM (Optimization of Complete Strategy Fuzzy C-Means) and Elastic E-t-SNE(Embedding t-Distributed Stochastic Neighbor Embedding ) algorithms are used to perform missing value filling and dimensionality reduction on key words in the library. And using entities in the academic text keyword library as vertices, a knowledge graph is established. Based on the part of speech and other features of keywords, a SelfATT BLSTM(Self Attention Bidirectional Long Short Term Memory) model is constructed using a self attention mechanism algorithm to extract entity relationships from the knowledge graph and obtain the extracted results. Experimental results have shown that the collection accuracy of proposed algorithm is more than 0. 8, with an ACC(Accuracy) value over 30% and a extraction time less than 1.5 s, demonstrating excellent ability to extract entity relationships. 

Key words: optimization of complete strategy fuzzy C-Means(OCS-FCM) algorithm, filling in missing data values, knowledge graph, self-attention bidirectional long short-term memory ( SelfATT- BLSTM) model

CLC Number: 

  • TP391