Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A Symmetry Analysis Method for Teaching Knowledge Graph Evolution Driven by Directed Attributed Graphs

View through CrossRef
Entity symmetry in teaching knowledge graphs is a characteristic of knowledge semantic expression and association, which plays a crucial role in the composition of knowledge structure. However, the evolution of the teaching knowledge graph may disrupt the symmetry of the knowledge structure, leading to the emergence of asymmetric phenomena and resulting in adverse effects on the subsequent search and representation of knowledge. Therefore, this article proposes a symmetry analysis method for the evolution of teaching knowledge graphs driven by directed attributed graphs. Firstly, a teaching knowledge graph model with directed attributed graphs is presented, on which the entity connection symmetry, entity center symmetry, and entity mirror symmetry of the teaching knowledge graph are defined. Then, the addition, replacement, and deletion of entity evolution rules that affect symmetry in the teaching knowledge graph model were characterized, and a teaching knowledge graph evolution algorithm based on directed attributed graph transformation was designed. On this basis, an in-depth analysis was conducted on the symmetry of the evolution of the teaching knowledge graph, which was disrupted and maintained. Finally, experiments verify that preserving or breaking symmetry has a significant impact on the connectivity and path complexity of knowledge graphs. In addition, a case study on the evolution of a Japanese major teaching knowledge graph with both symmetric and asymmetric transformations is provided to validate the feasibility and effectiveness of the proposed directed attributed graph driven symmetry analysis method for educational knowledge graph evolution.
Title: A Symmetry Analysis Method for Teaching Knowledge Graph Evolution Driven by Directed Attributed Graphs
Description:
Entity symmetry in teaching knowledge graphs is a characteristic of knowledge semantic expression and association, which plays a crucial role in the composition of knowledge structure.
However, the evolution of the teaching knowledge graph may disrupt the symmetry of the knowledge structure, leading to the emergence of asymmetric phenomena and resulting in adverse effects on the subsequent search and representation of knowledge.
Therefore, this article proposes a symmetry analysis method for the evolution of teaching knowledge graphs driven by directed attributed graphs.
Firstly, a teaching knowledge graph model with directed attributed graphs is presented, on which the entity connection symmetry, entity center symmetry, and entity mirror symmetry of the teaching knowledge graph are defined.
Then, the addition, replacement, and deletion of entity evolution rules that affect symmetry in the teaching knowledge graph model were characterized, and a teaching knowledge graph evolution algorithm based on directed attributed graph transformation was designed.
On this basis, an in-depth analysis was conducted on the symmetry of the evolution of the teaching knowledge graph, which was disrupted and maintained.
Finally, experiments verify that preserving or breaking symmetry has a significant impact on the connectivity and path complexity of knowledge graphs.
In addition, a case study on the evolution of a Japanese major teaching knowledge graph with both symmetric and asymmetric transformations is provided to validate the feasibility and effectiveness of the proposed directed attributed graph driven symmetry analysis method for educational knowledge graph evolution.

Related Results

Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...

Back to Top