Knowledge Graph Generation Algorithm Based on Bayesian Network

The knowledge graph is a structured knowledge base used to describe concepts, entities, and their interrelationships in the physical world in symbolic form. Compared to large models, knowledge graphs have more explicit knowledge representation and structural advantages. Having stronger data integration and processing capabilities, reasoning and interpretability. This article is based on the Bayesian network structure learning algorithm MMPC (Max-Min Parents and Children), and constructs a knowledge graph through three modifications: Firstly, we use text segmentation and calculation of intersection to union ratio to preliminarily measure the coupling relationship between entities, reduce irrelevant entities, and lower computational complexity. Besides, mutual information clustering algorithm is used to improve the accuracy of independence judgment. Finally, we use a greedy algorithm based on information entropy gain ratio to find the optimal network structure.

Authors

Publication Details

Published
2025-03-14
DOI
https://doi.org/10.1109/itoec63606.2025.10967734
Primary Topic
Advanced Computational Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Knowledge Graph Generation Algorithm Based on Bayesian Network

Guanlin Si, Min Li, Yifang Sun, Lin Li et al.
Advanced Computational Techniques and Applications
article

Knowledge Graph Generation Algorithm Based on Bayesian Network

Guanlin Si, Min Li, Yifang Sun, Lin Li, Cong Hou
article en

Abstract

The knowledge graph is a structured knowledge base used to describe concepts, entities, and their interrelationships in the physical world in symbolic form. Compared to large models, knowledge graphs have more explicit knowledge representation and structural advantages. Having stronger data integration and processing capabilities, reasoning and interpretability. This article is based on the Bayesian network structure learning algorithm MMPC (Max-Min Parents and Children), and constructs a knowledge graph through three modifications: Firstly, we use text segmentation and calculation of intersection to union ratio to preliminarily measure the coupling relationship between entities, reduce irrelevant entities, and lower computational complexity. Besides, mutual information clustering algorithm is used to improve the accuracy of independence judgment. Finally, we use a greedy algorithm based on information entropy gain ratio to find the optimal network structure.

Openalex Percentile: Top 96%
Advanced Computational Techniques and Applications
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.

Knowledge Graph Generation Algorithm Based on Bayesian Network — Guanlin Si, Min Li, et al. · (2025) | TGRS Research Map | TGRS