Next Article in Journal
Enrichment of Metals in the Sediments of an Industrially Impacted Estuary: Geochemistry, Dispersion and Environmental Considerations
Next Article in Special Issue
Developing Computational Thinking: Design-Based Learning and Interdisciplinary Activity Design
Previous Article in Journal
Lane-Changing Strategy Based on a Novel Sliding Mode Control Approach for Connected Automated Vehicles
Previous Article in Special Issue
Digital Technology in Managing Erasmus+ Mobilities: Efficiency Gains and Impact Analysis from Spanish, Italian, and Turkish Universities
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Dynamic Generation of Knowledge Graph Supporting STEAM Learning Theme Design

1
School of Educational Information Technology, South China Normal University, Guangzhou 510631, China
2
School of Computer Science and Intelligence Education, Lingnan Normal University, Zhanjiang 524048, China
*
Author to whom correspondence should be addressed.
Appl. Sci. 2022, 12(21), 11001; https://doi.org/10.3390/app122111001
Submission received: 27 September 2022 / Revised: 27 October 2022 / Accepted: 28 October 2022 / Published: 30 October 2022
(This article belongs to the Special Issue STEAM Education and the Innovative Pedagogies in the Intelligence Era)

Abstract

:
Instructional framework based on a knowledge graph makes up for the interdisciplinary theme design ability of teachers in a single discipline, to some extent, and provides a curriculum-oriented theme generation path for STEAM instructional design. This study proposed a dynamic completion model of a knowledge graph based on the subject semantic tensor decomposition. This model can be based on the tensor calculation of multi-disciplinary curriculum standard knowledge semantics to provide more reasonable STEAM project-based learning themes for teachers of those subjects. First, the STEAM multi-disciplinary knowledge semantic dataset was generated through the course’s standard text and open-source encyclopedia data. Next, based on the semantic tensor decomposition of specific STEAM topics, the dynamic generation of knowledge graphs was realized, providing interdisciplinary STEAM learning topic sequences for teachers of a single discipline. Finally, the application experiment of generating STEAM learning themes proved the effectiveness of our model.

1. Introduction

STEAM education involves the integration of multi-disciplinary instructional design with specific themes. However, teachers trained in a single discipline can hardly meet the requirements of STEAM multi-disciplinary theme design [1]. As a multi-disciplinary instructional framework, the subject knowledge graph, with its rich semantic relevance, is expected to solve the problem of STEAM multi-disciplinary theme design. However, the current knowledge graph of disciplines is still unable to provide teachers with appropriate STEAM learning topics according to the instructional requirements of the curriculum standards, which leads to serious disconnection of the knowledge system of various disciplines in STEAM education. Therefore, how to effectively support the generation of appropriate STEAM learning topics through the dynamic cutting and completion of the subject knowledge graph has become an important research question.
In recent years, since the tensor decomposition model has flexible computing capability for potential semantic features, it is regarded by researchers as a key algorithm model for developing the learners’ knowledge graph from the basic lower cognitive stages to the higher panoramic cognitive stages [2]. Presently, the dynamic organization effect of multi-disciplinary learning resources on STEAM learning topics is not appropriate enough, and it has not been found that STEAM teachers can be configured with learning topics that meet the learning requirements of the curriculum standards. The application of the tensor decomposition model in the STEAM multi-disciplinary semantic association and its completion of the panoramic knowledge graph provides relatively ideal support for STEAM learning theme content organization. This method helps single-discipline teachers to organize, discover, configure, and recommend appropriate themes of interdisciplinary learning.
This study had three main objectives:
(1)
To propose the dynamic generation technology of subject knowledge graph technology, which includes two types of technical solutions: knowledge graph generation based on basic data sets, and STEAM subject knowledge graph completion oriented to curriculum standards in order to achieve flexible STEAM subject generation and design for single-subject teachers.
(2)
To integrate multiple APIs to conduct multiple trainings on data sets to meet the requirements for entity recognition and semantic modeling of the subject knowledge graph under different personalized learning scenarios. Among them, the conditional random field and tensor decomposition algorithm achieved the best semantic relationship modeling effect.
(3)
To introduce the high-order singular value decomposition with orthogonal iteration (HO-SVD-OI) for the tensor decomposition algorithm of a penalty function and the high-dimensional orthogonal iteration mechanism to calculate the matches between STEAM learning resources and learners’ cognitive styles in different stages. The simulation results show that the algorithm optimization strategy had good computational performance on the topic coverage of STEAM learning themes.

2. Related Works

2.1. The Interdisciplinary Instruction of STEAM Project

The research field of STEAM interdisciplinary project teaching, which originated from the design and development of interdisciplinary medical courses in colleges and universities, is very active [3]. Cuadrado and others were the first to introduce the STEAM interdisciplinary teaching field supported by ICT [4]. Many studies have confirmed that interdisciplinary teaching with ICT integration contributes to problem-solving and deep exploration in real situations [5,6,7]. Chen et al. studied the design and application of theme resources in STEAM interdisciplinary learning scenarios based on empirical research on the application of an interdisciplinary online learning resource recommendation system [8]. Subsequently, interdisciplinary education supported by information technology has been widely used in higher medical [9] and engineering education [10], aiming to cultivate interdisciplinary professionals with good interdisciplinary teamwork and comprehensive discipline quality. However, relevant research, such as knowledge graph and other cognitive intelligence technologies, is still relatively rare in assisting teachers to carry out STEAM theme designs.

2.2. Dynamic Generation and Completion of Knowledge Graph

With the algorithm performance improvement of machine learning and its wide application in the field of natural language processing, some scholars have conducted research on the construction methods of knowledge graphs. Based on intelligent algorithms such as machine learning or deep learning, they have endeavored to dynamically build entity data models, semantic relationship models, and graph quality control methods of the subject knowledge graphs, in order to realize large-scale entity construction and relationship organization of multi-modal unstructured data in the intelligent learning environment [11,12]. The dynamic completion and division of a knowledge graph based on representation learning and tensor decomposition is one of the frontier research fields in the current computer science community for the intelligent and dynamic construction of subject knowledge graphs. Common implementation methods include the model ConMask [13] based on entity embedding, TansH [14], TansR [15], TansE [16] based on the distance translation of neural tensor network structure, etc. However, if the number of entities or their relationship links show an extremely uneven distribution, its completion performance becomes not ideal enough. Some scholars also pay attention to semantic path sorting based on feature space similarity [17], reinforcement learning [18], and small sample learning algorithm [19], and they consider entity-embedded representation and local semantic network sparsity to optimize the completion effect of a knowledge graph. Machine learning makes this possible for large-scale entities of subject knowledge graphs and their semantic intelligent computing, thus promoting the transition of subject knowledge graphs from extensive semantics to precise semantics in subject knowledge fusion and digital education resource organization. However, due to the collaboration of learners’ cognitive states, their preferences, and the process changes in multi-disciplinary learning activities, there is still a broad research space to dynamically generate and complete discipline knowledge graphs through machine learning.

2.3. Application of Knowledge Graph in Instructional Design

Presently, in the application of the international education knowledge graph in instructional design, natural language processing [20], data mining [21], visualization [22], deep learning [23], and other artificial intelligence technologies are closely related to its cutting-edge development. Chen et al. used machine learning algorithms to train heterogeneous data, such as teaching content and learning evaluation in the field of education. They proposed an automatic construction method of an education knowledge graph based on neural sequence markers and probabilistic association rule mining [24]. Jia and others implemented a personalized learning recommendation service application based on the semantic similarity calculation of a discipline knowledge graph [25]. Nayyeri and others developed the semantic link prediction by embedding the model of Trans4E in an academic resource knowledge graph based on AIDA, MAG, and other benchmark datasets [26]. Based on the knowledge graph model of science and technology resources, Chi and others built an interdisciplinary, cross-domain, and multi-application academic resource retrieval and analysis platform to help improve the intelligent organization and management of the academic resources in colleges and universities [27].

3. Methodology

This section proposes a dynamic generation method for knowledge graphs of STEAM themes, including three technical processes: the dynamic generation of cross-modal subject knowledge graphs based on natural language processing, dynamic completion of subject knowledge graphs based on the tensor semantic decomposition model, and quality evaluation of subject knowledge graphs for STEAM interdisciplinary curriculum standards.

3.1. Knowledge Graph Generation of STEAM Instructional Themes

The subject knowledge graph is the key cornerstone of interdisciplinary instructional design for realizing the multi-disciplinary knowledge collaboration of STEAM. Machine learning intelligence, with the semantic annotation of a large-scale knowledge corpus, enables teachers of a single subject to design STEAM learning themes that are appropriate for the curriculum standards. Based on our research of the key technologies of knowledge graphs at home and abroad, this study proposed a dynamic generation framework of STEAM subject knowledge graphs based on a multi-algorithm collaboration, as shown in Figure 1.
The data set for constructing a STEAM discipline knowledge graph comes from two channels: (1) unstructured data based on national discipline curriculum standards, digital textbooks, and texts; and (2) open-source semi-structured data, such as encyclopedia entries on OpenKG. The knowledge system of unstructured data, such as national discipline curriculum standards and digital textbooks in the atlas, is more precise and rigorous. The open-source encyclopedia entry data are open and collaborative, and its knowledge system in the atlas is more dynamic and extensive. The knowledge systems of the two data channels complement each other, and together they form multi-disciplinary teaching domain knowledge with strong integrity that conforms to the national discipline curriculum standards and academic quality system. At the same time, it also has the same degree of applicability for constructing the methodology of knowledge graphing for a single discipline. From the above technical work summary, it can be seen that unstructured texts on national subject curriculum standards or digital textbooks can be transformed into a structured triplet of subject knowledge graphs only through the BERT model’s neural network attention-mapping mechanism. The process and method of knowledge extraction in this link are relatively mature and also applicable to semi-structured data, such as open-source encyclopedia entry data. Technically, it is still very difficult for us to map the knowledge system space in the cognitive field, which is suitable for learning characteristics in each academic stage. There are two specific possible solutions: (1) Under the metadata design mode of the current subject knowledge graph, the open-source encyclopedia entry data are manually marked, and an unstructured training set that matches the knowledge ability level described in the national subject curriculum standard is built. It provides an excellent, labeled training source for the supervised learning algorithm, but its labor cost is obviously too high. (2) Based on the standardized corpus generated by the curriculum standard or contents of digital textbooks, the remote semi-supervised learning method is employed to generate the semantic data labels of some discipline knowledges. At this time, algorithm intelligence is used to replace heavy repetitive work, reducing the cost of artificial semantic labels for large-scale datasets. However, the semi-supervised learning algorithm cannot ensure that the discipline semantic labels of the training set that was constructed fully comply with the discipline curriculum standards in terms of knowledge compliance. Therefore, strict requirements for accuracy, such as applicability, may affect the further iterative training effect of machine learning algorithms.
The dynamic construction of STEAM’s interdisciplinary knowledge graph is reflected not only in the integration and openness of its encapsulation algorithm library API, but also in its intelligent configurability of the knowledge graph of various disciplines, which is specifically divided into the core stages of multi-disciplinary knowledge fusion, representation, completion, error correction, and update. Multi-discipline knowledge fusion refers to entity alignment and attribute fusion of multi-group and multi-discipline knowledge data. In addition to the above basic tuple elements such as “head entity—relational predicate—tail entity”, the multi-group data processed by the multi-disciplinary knowledge extraction algorithm also contain multi-group knowledge mixed with other language elements, such as time, place, degree modifier, etc. In order to realize the standardized semantic storage, linking, reasoning, etc., of the multi-group knowledge, it is necessary to regularize the tensor decomposition of the mixed elements in the multi-group; the knowledge representation is further matched with the triple representation in the current discipline knowledge graph so as to build a discipline knowledge graph configuration unit with a standardized data format, clear semantic association, and multiple reasoning paths. The representation of multi-disciplinary knowledge refers to the problem of how to map the expression forms of various multi-disciplinary knowledge in different cognitive intelligence fields. The multi-disciplinary knowledge in the learner’s cognitive intelligence development field is represented as symbolic information, and the multi-disciplinary knowledge in the machine’s cognitive learning intelligent field is represented as vectorized information. The disciplinary knowledge graph itself becomes the interface between the knowledge symbolic representation and vectorized representation to meet the needs of knowledge flow and integration in their respective fields. The completion, error correction, and updating of multi-disciplinary knowledge is a mechanism for the collaborative optimization of multi-disciplinary knowledge quality in the process of data fusion and the representation of graph corpus between learners and machines during multi-disciplinary learning. On the one hand, it dynamically updates the semantic relationship of associated conceptual entities among disciplines by encapsulating and integrating various panoramic knowledge graph completion algorithms’ API, and it promotes the configuration and integration of discipline graphs. On the other hand, through the joint training and learning of large-scale corpus semantic data, we can detect the logical fallacy of semantic relations between different entities and update knowledge cooperatively, so as to build a cognitive intelligence dynamic architecture for the appropriate instructional design of STEAM themes.

3.2. Knowledge Graph Completion of STEAM Instructional Themes

The STEAM interdisciplinary knowledge graph has an interdisciplinary and multi-level cognitive development path. It aims to cultivate learners’ multi-clue and multi-dimensional problem-solving thinking and ability. The dynamic completion of the disciplinary knowledge graph provides an intelligent cognitive framework for teachers to carry out interdisciplinary instructional design. It also enables learners to construct multi-personalized meanings for multi-disciplinary learning tasks. The completion of the STEAM knowledge graph refers to using the tensor decomposition model to convert the data of various topic maps that are related to each other or have a learning order (before and after knowledge) into a data form that is easy to be processed by the computer. Next, the semantic relationship between the subject knowledge points is mined to predict and embed the potential semantic relationship between new and old knowledge entities or their attributes. Finally, the intelligent and dynamic completion of the subject knowledge graph is realized. According to the knowledge learning path of different disciplines of STEAM, the completion path of a STEAM knowledge graph also presents multiple dynamics.
Before introducing the tensor decomposition model applied to STEAM knowledge graph embedding, the following symbol definitions were decided:
The knowledge triple is represented by (head entity, relationship type, tail entity), which is denoted as ( h , r , t ) and abbreviated as φ . The Greek letter X represents the three-dimensional knowledge tensor, and the elements in X are represented by X i , j , k . The capital letter A represents the matrices model, which is used to represent entity sets and relationship type sets, whereas | A | represents the size of the matrices. The lowercase letter a represents a vector, where item i is represented by a i . × n represents the Tucker product, which is used for the product of the three-dimensional knowledge tensor and matrix. The operator “ ” represents the product of a vector.
In STEAM multi-disciplinary project-based instruction, the relationships among knowledges are often numerous, and their semantics are connected; in addition, the representation of the relationships is not unique. To simplify the principle introduction, the knowledge semantic relationship is represented as a triple. Taking “Mendel’s Law of Inheritance” as an example, the random combination of dominant genes and recessive genes of organisms determines various traits, and the corresponding probability can be obtained through mathematical modeling. Therefore, its knowledge semantics can be represented by a composite triple (Mendel’s law, mathematical modeling/material basis, and a random combination of probability/DNA genetic information). When it is extended to the tensor model, the knowledge triplet is constructed as a three-dimensional tensor, in which two dimensions are composed of knowledge head and tail entities (such as Mendel’s law or a random combination of probability/DNA genetic information) and the third dimension is the relationship between knowledges (mathematical modeling/material basis).
Take the classic algorithm of the Tucker decomposition [28] of a tensor model as an example. For the three-dimensional tensor in the subject knowledge graph, the Tucker decomposition can obtain the core tensor and three knowledge matrices, as shown in Formula (1).
X G ; A , B , C G × 1 A × 2 B × 3 C p = 1 P q = 1 Q r = 1 R g p q r a p b q c r
Among them, the core tensor G represents the level of semantic relationship between knowledge entities and relationships, which can be used for a potential semantic analysis of knowledge points and knowledge relationships. In essence, tensor decomposition is to decompose the potential semantic relationship of new knowledge through the dimension reduction processing of complex knowledge structures and the dimension reduction algorithm of model structures, so as to generate new knowledge structures that do not exist in the original graph spectrum and to promote the STEAM project to learn multiple observation perspectives and solve multi-clue problems. Therefore, the tensor model is suitable for the dynamic completion of the subject knowledge map, and the semantic relationship cohesion of the subject knowledge is improved through the dynamic embedded model.
Combined with the tensor decomposition algorithm, this study proposed a dynamic completion model of a STEAM interdisciplinary knowledge graph as shown in Figure 2. The main idea of the model is to reflect the hidden information of knowledge through tensor decomposition into a low-dimensional matrix, which is used to estimate the incomplete part of the original discipline knowledge graph. The model extracts knowledge triplets from the knowledge graph of a single discipline to form a data set. The positive and negative samples in the data set of a single discipline are constructed into a three-dimensional knowledge tensor, which is decomposed into a low-dimensional knowledge matrix by Tucker and sent to the scoring function. The embedded entities and relationships are constantly updated by the optimizer, and the implicit relationships between knowledges are mined to supplement the STEAM interdisciplinary knowledge graph as a newly generated knowledge connection.
In order to establish relationships among the knowledge entities with unknown relationships, the model uses the replacement method to replace the correct knowledge triplet entities into negative triples. For prediction, the S i g m o i d function is used as the activation function to predict the correctness of the triple through probability. For optimization, the model uses the logarithmic likelihood loss function to measure the quality of the model’s prediction.

3.3. Quality Assessment of STEAM Knowledge Graph Based on Curriculum Standards

The matching degree between the subject knowledge system and the subject accomplishment evaluation index in the STEAM curriculum standard is an important indicator for measuring the quality of the generation and completion of the subject knowledge graph. Whether it is the generation of the subject knowledge graph or the dynamic completion of the subject knowledge graph based on different teaching objectives and teaching themes, the quality evaluation index should focus on the teaching connectivity and teaching appropriateness of the map. The teaching connectivity is calculated by the dynamic performance of the interdisciplinary knowledge of the atlas, while the teaching appropriateness is calculated by the cognitive and evaluation matching degree of the discipline curriculum standards related to the STEAM teaching theme of the atlas. Therefore, its quality evaluation methods include the matching degree calculation methods of the knowledge atlas completion performance based on tensor model and the academic quality evaluation indicators based on the discipline curriculum standards. We evaluated whether the constructed discipline knowledge graph had good dynamic embedding performance; that is, whether the discipline knowledge graph met the dynamic embedding of entity relations with multi-modal attributes. The test data selected multi-source heterogeneous data, such as digital education resource library and public service resource metadata, through MRR, Hits@1, Hits@3, and Hits@10 to calculate the matching effect between the subject knowledge graph and the subject curriculum standard knowledge system.
The Mean Reciprocal Rank (MRR) is the average reciprocal ranking of embedded entities in the discipline knowledge graph. The larger the index is, the better the matching effect is, as shown in Formula (2).
MRR = 1 | S | i = 1 | S | 1 r a n k i = 1 | S | ( 1 r a n k 1 + 1 r a n k 2 + + 1 r a n k | S | )
Hits@N is the average proportion of triples ranking less than N in the prediction of a STEAM interdisciplinary knowledge link. The larger the index is, the better the matching effect is, as shown in Formula (3).
Hits @ N = 1 | S | i = 1 | S | I ( r a n k i n )
Conversely, we evaluated whether the constructed subject knowledge graph matched the instructional requirements of the subject curriculum standards of each learning segment, such as whether the generated and completed subject knowledge graph met the teaching objectives, resource organization, and activity design of STEAM teachers based on interdisciplinary curriculum standards while meeting the requirement of providing students with cognitive support, resource recommendations, and learning path planning based on the subject curriculum standards. Therefore, the matching data set of the evaluation method was the text data of the curriculum standards of each discipline of STEAM. Through the knowledge extraction, knowledge annotation, knowledge matching, and other links of the curriculum standard text, the matching degree of the curriculum standard teaching requirements of each discipline can be measured according to the phased output of each link. Specifically, it includes the matching of the subject knowledge graph and the cognitive level of the subject curriculum standard, and the matching of the academic quality with literacy evaluation indicators.

4. Experiments

4.1. Data Set Construction

(1)
Source of data set: The data set selected for the experiment came from the subject curriculum standard, digital textbook text, and open-source Chinese encyclopedias, mainly including the concepts and relationships of biology, chemistry, geography, and mathematics in middle schools. The resource data set came from the EdX MOOC platform, which covers mathematical science, natural science, humanities and social sciences, engineering technology, and other fields. From 2013 to 2019, 36,892 users learned and browsed 528,536 course resource files, with 372 feature status tags in total.
(2)
Data set preprocessing: First, we cleaned and removed learner and course resource records with feature frequency lower than 50 to prevent the cold start of machine learning. We then removed the user data whose feature frequency was less than 1000 to prevent the interference of the crawler. Finally, we removed the curriculum resource records whose resource access frequency was less than 30 to prevent the clustering effect from discretization caused by low-frequency tags.
(3)
Segmentation of training set and test set: After the above preprocessing, 68,745 effective records of resource learning with feature annotation were obtained, 85% of the data was randomly selected to construct the training set, and 15% of the data was used to construct the test set.
(4)
Model training and testing: In the training set, the random algorithm used at least one marked learning situation feature tag as the learner’s cognitive state feature tag. In the test set, the records of curriculum resources were fitted with tensor models to calculate relevant evaluation indicators.

4.2. Analysis of STEAM Interdisciplinary Instructional Cases and Generation of Themes

The instructional case comes from the high school STEAM interdisciplinary instructional case of the experimental school of the research group. The instructional case takes nutrition science, cultivation technology, horticultural culture, and related literary works of peas as the instructional theme and carries out project instructions from the perspectives of biological properties, geographical distribution, nutrient composition, modern farming technology, landscape culture, historical literature, and other disciplines. The knowledge points cover many basic education disciplines, such as chemistry, biology, geography, mathematics, physics, history, and literature; they include learning the principles of pea science and technology, pea gardening culture and literary works, field research practice of pea plantations, and the sharing and exchange of interdisciplinary learning achievements.
The learners are the first year students of the experimental high school. During the course of project learning, they are divided into a pea science and technology research group and a pea culture exploration group, according to the learners’ cognitive preference style. Under the activity mode of group cooperation, they carry out personalized learning and research on the related scientific principles, agricultural technology, horticultural culture, literary works, and other sub-topic keywords of pea, respectively, with the support of the subject knowledge graph. Its subject learning theme keywords take “pea” as the central word, “scientific principles, agricultural technology, horticultural culture, and literary works” as the clues of knowledge and resource organization and management, and learners’ cognitive style preferences and state attributes as the sequence feature tags to dynamically generate multi-disciplinary learning paths and resource allocation sequences under different cognitive style tags. The knowledge structure system based on the corresponding subject curriculum standards dynamically retraces the semantic relationship between the old knowledge and the new knowledge of learners, and it maps the hierarchical characteristics of cognitive ability between the learning sequence of learners’ knowledge and the sequence of resource organization, so as to realize personalized multi-disciplinary intelligent learning. Finally, under the support of the subject knowledge graph, the learners are guided to dialectically understand the cooperative development relationship between crop science and technology and human farming culture through group communication and sharing. This section takes the STEAM instructional activity of Exploring the Scientific Principles of Peas as an example to show the dynamic generation effect of interdisciplinary knowledge graphs based on the curriculum standards of chemistry, biology, geography, and mathematics. The generated STEAM interdisciplinary thematic knowledge graph is shown in Figure 3.

5. Results and Discussion

5.1. Performance Results of Comparison Simulation Experiment

In the training set data, the corresponding TopN list of each learner was calculated by the multi-disciplinary semantic tensor decomposition algorithm HO-SVD-OI in this section. The accuracy recall curve was used to reflect the changing trend of the accuracy of the method in this paper and the mainstream classical algorithm in matching STEAM learning topics with course standards, and the performance gap of different algorithms was reflected by the harmonic mean F1 index [29]. In this section, we selected the Kmeans IDF algorithm [30] based on semantic tags and K-means clustering of user access resources, the classical tensor decomposition Co SClu algorithm [31] based on semantic tag co-occurrence spectrum clustering, and the classical TD algorithm [32] based on original tensor decomposition as the reference comparison algorithm.
The P-R curve and F1 index curve simulation results of the above four algorithms are shown in Figure 4. In the P-R curve comparison chart, as the training scale of the data set increased, the accuracy and recall rate of the algorithm showed a reverse proportion change trend. The more the values gathered to the upper right side of the image area, the better the matching effect of the digital learning resources organized by the algorithm on the learner’s knowledge tag. In the F1 index curve comparison chart, the more values gathered above the image area, the higher the accuracy of the learning topics generated by the algorithm for the coverage of multi-disciplinary curriculum standards. In addition, whether it was the HO-SVD-OI algorithm applied in this chapter or the high-dimensional semantic tensor decomposition resource organization matching algorithm based on Kmeans clustering or spectral clustering proposed by our predecessors, its performance was significantly better than that of the simple tensor decomposition algorithm. By observing the F1 index curve, we found that when the scale of STEAM learning topics approached about 20, the four algorithms all achieved the best performance in the coverage accuracy of the STEAM discipline curriculum standard.

5.2. Discussion on Learning Path Based on STEAM Interdisciplinary Knowledge Graph

When learners complete STEAM project learning, they generally have a relatively complete discipline knowledge structure in the lower learning stage. In the context of STEAM interdisciplinary project learning, the dynamic completion of a discipline knowledge graph is essentially a process of personalized meaning construction of learners for high-level learning objects, thus promoting the gradual formation of high-level knowledge and literacy of disciplines.
In the key words knowledge graph of the project theme shown in Figure 3, the teaching goal of the project is to solve the problem of “the causes of the diversity of pea genetic traits”, while the original knowledge structure of the learners is the relevant scientific principle “Mendelian genetic law conducts mathematical modeling through the probability learned in junior high school, and the expression of biological genetic traits is determined by their DNA”. The new knowledge that learners need to master is that “the deep reason for the establishment of Mendel’s Law is that biological genetic material DNA has the random characteristics of free separation and combination, and the random combination characteristics of genetic material lead to the diversification of genetic traits, thus contributing to the diversity of biological genetics and evolution directions”. The STEAM interdisciplinary knowledge graph supports single-discipline teachers to design project learning path steps as follows:
Step 1: According to the high school biology curriculum standard, the triple of the original knowledge graph is marked as the literacy evaluation index V(ij), indicating the literacy level that learners should reach when learning corresponding knowledge ( h , r , t ) , where i represents the triple knowledge sequence, and j represents the literacy evaluation level sequence.
Step 2: According to the quality evaluation index system of the subject curriculum standards, the subject project teaching topics of different subject quality levels are presented. For example, for the learning needs of mathematical logic computing quality evaluation, teachers can build appropriate mathematical models for learners to deduce and verify the “randomness of biological genetic material combination” according to the quality evaluation index labels (junior high school, mathematics, event probability, mathematical modeling, and problem-solving) and can support learners to understand the essence of problem-solving from the evolution of mathematical variables. For the learning needs of spatial structure analysis literacy, teachers can build “the combination and change law of DNA microstructure in the genetic process” for it through spatial micro-analysis according to the quality evaluation index labels (junior high school, chemistry, structure of life macromolecules, scientific inquiry, macro-identification, and micro-analysis). Different goal orientation will lead to different paths of STEAM project learning activities.
Step 3: When learners choose different ways to organize corresponding discipline project resources, teachers will provide necessary assistance and intervention according to their learning process and learners’ dynamic generation and completion direction of the discipline knowledge graph based on derived theme keywords, adjust the direction and level of learners’ personalized meaning construction, and finally achieve the overall goal of STEAM project teaching that meets the discipline curriculum standards.

6. Conclusions and Future Work

Presently, there are many kinds of mature natural language processing and machine learning algorithms in the computer science field. The application of a single algorithm cannot meet the context or scene adaptability requirements of the entity recognition accuracy and relational semantic modeling of the STEAM interdisciplinary knowledge graph from different perspectives. It is necessary to integrate multiple APIs to conduct multiple trainings on data sets to meet the needs of teachers in a single discipline for the design of STEAM interdisciplinary teaching themes; among them, conditional random field and tensor decomposition algorithms are relatively ideal for semantic relationship modeling. On the one hand, the dynamic generation of a STEAM subject knowledge graph can enable teachers of a single subject to flexibly organize instructional resources and improve teaching efficiency in an intelligent learning environment. On the other hand, a STEAM subject knowledge map can effectively plan personalized learning paths by adapting to learners’ cognitive characteristics, thus broadening learners’ multi-dimensional thinking ability.
Although the traditional tensor decomposition algorithm has good performance for the generation of STEAM multi-disciplinary topics, it is easy to form a STEAM “topic cocoon room” due to the long-term recommendation of high-frequency single discipline themes, which are not conducive to the development of learners’ multiple cognitive abilities. The HO-SVD-OI tensor decomposition algorithm, which introduces a penalty function and high-dimensional orthogonal iteration mechanism, has good computational performance for the matching and coverage of STEAM learning themes and multi-disciplinary curriculum standards; it can effectively eliminate the problem of a “theme cocoon room” in STEAM instructional design. Future research will focus on the interpretability mechanism of knowledge graphs for STEAM interdisciplinary semantic learning.

Author Contributions

Conceptualization and supervision, Q.K.; Writing—original draft, J.L. All authors have read and agreed to the published version of the manuscript.

Funding

This study was funded by the National Key R&D Program of China (2022YFC3303600) and the Guangdong Provincial Philosophy and Social Science Foundation (GD22TWCXGC10).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Elaine, P.; Jen, K.B. STEAM in practice and research: An integrative literature review. Think. Ski. Creat. 2019, 31, 31–43. [Google Scholar]
  2. Zhang, Z.; Cai, J.; Wang, J. Duality-Induced regularizer for tensor factorization based knowledge graph completion. In Proceedings of the 34th Conference on Neural Information Processing Systems (NeurIPS 2020), Vancouver, BC, Canada, 6–12 December 2020. [Google Scholar]
  3. Levine, A.E.; Bebermeyer, R.D.; Chen, J.W.; Davis, D.; Harty, C. Development of an Interdisciplinary Course in Information Resources and Evidence-Based Dentistry. J. Dent. Educ. 2008, 72, 1067–1076. [Google Scholar] [CrossRef] [PubMed]
  4. Cuadrado, M.; Molina, M.E.R.; Coca, M. Participation and performance of university students in an interdisciplinary and bilingual e-learning project. Rev. Educ. 2009, 348, 279–280. [Google Scholar]
  5. Van Til, R.P.; Tracey, M.W.; Sengupta, S.; Fliedner, G. Teaching Lean with an Interdisciplinary Problem-solving Learning Approach. Int. J. Eng. Educ. 2009, 25, 173–180. [Google Scholar]
  6. Havnes, A. Talk, planning and decision-making in interdisciplinary teacher teams: A case study. Teach. Teach. 2009, 15, 155–176. [Google Scholar] [CrossRef]
  7. Pharo, E.J.; Davison, A.; Warr, K.; Nursey-Bray, M.; Beswick, K.; Wapstra, E.; Jones, C. Can teacher collaboration overcome barriers to interdisciplinary learning in a disciplinary university? A case study using climate change. Teach. High. Educ. 2012, 17, 497–507. [Google Scholar] [CrossRef]
  8. Chen, H.R.; Huang, J.G. Exploring Learner Attitudes toward Web-based Recommendation Learning Service System for Interdisciplinary Applications. Educ. Technol. Soc. 2012, 15, 89–100. [Google Scholar]
  9. Briede-Westermeyer, J.C.; Perez-Villalobos, C.E.; Bastias-Vega, N.; Bustamante-Durán, C.E.; Olivera-Morales, P.; Parra-Ponce, P.; Delgado-Rivera, M.; Cabello-Mora, M.; Campos-Cerda, I. Interdisciplinary experience for the design of health care products. Rev. Med. Chile 2017, 145, 1289–1299. [Google Scholar] [CrossRef]
  10. Van den Beemt, A.; MacLeod, M.; Van der Veen, J.; van de Ven, A.; van Baalen, S.; Klaassen, R.; Boon, M. Interdisciplinary engineering education: A review of vision, teaching, and support. J. Eng. Educ. 2020, 109, 508–555. [Google Scholar] [CrossRef]
  11. Lin, Y.S.; Chang, Y.C.; Liew, K.H. Effects of concept map extraction and a test-based diagnostic environment on learning achievement and learners’ perceptions. Br. J. Educ. Technol. 2016, 47, 649–664. [Google Scholar] [CrossRef]
  12. Wen, Y.; Lool, C.K.; Chen, W. Appropriation of a representational tool in a second-language classroom. Int. J. Comput. Support. Collab. Learn. 2015, 10, 77–108. [Google Scholar] [CrossRef]
  13. Shi, B.X.; Weninger, T. Open-World knowledge graph completion. In Proceedings of the 32nd International Conference on Artificial Intelligence, New Orleans, LA, USA, 2 February 2018; pp. 1957–1964. [Google Scholar]
  14. Socher, R.; Chen, D.; Manning, C.D.; Ng, A.Y. Reasoning with neural tensor networks for knowledge base completion. In Proceedings of the 26th International Conference on Neural Information Processing Systems, Lake Tahoe, NV, USA, 5–10 December 2013; pp. 926–934. [Google Scholar]
  15. Wang, Z.; Zhang, J.; Feng, J.; Chen, Z. Knowledge graph embedding by translating on hyperplanes. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, Québec City, QC, Canada, 27–31 July 2014; pp. 1112–1119. [Google Scholar]
  16. Lin, Y.; Liu, Z.; Sun, M.; Liu, Y.; Zhu, X. Learning entity and relation embeddings for knowledge graph completion. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, Austin, TX, USA, 25–30 January 2015; pp. 2181–2187. [Google Scholar]
  17. Gardner, M.; Talukdar, P.; Krishnamurthy, J.; Mitchell, T. Incorporating vector space similarity in random walk inference over knowledge bases. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing, Doha, Qatar, 25–29 October 2014; pp. 397–406. [Google Scholar]
  18. Xiong, W.; Hoang, T.; Wang, W.Y. DeepPath: A reinforcement learning method for knowledge graph reasoning. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, Copenhagen, Denmark, 7–11 September 2017; pp. 564–573. [Google Scholar]
  19. Xiong, W.; Yu, M.; Chang, S.; Guo, X.; Wang, W.Y. Oneshot relational learning for knowledge graphs. In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, 31 October–4 November 2018; pp. 1980–1990. [Google Scholar]
  20. Hematialam, H.; Garbayo, L.; Gopalakrishnan, S.; Zadrozny, W.W. A Method for Computing Conceptual Distances between Medical Recommendations: Experiments in Modeling Medical Disagreement. Appl. Sci. 2021, 11, 2045. [Google Scholar] [CrossRef]
  21. Liu, H.Y.; Zhang, T.C.; Li, F.; Gu, Y.; Yu, G. Tracking Knowledge Structures and Proficiencies of Students with Learning Transfer. IEEE Access 2021, 9, 55413–55421. [Google Scholar] [CrossRef]
  22. Kim, M.C.; Feng, Y.Y.; Zhu, Y.J. Mapping scientific profile and knowledge diffusion of Library Hi Tech. Libr. Hi Tech 2021, 39, 549–573. [Google Scholar] [CrossRef]
  23. Gaur, M.; Faldu, K.; Sheth, A. Semantics of the Black-Box: Can knowledge graphs help make deep learning systems more interpretable and explainable? IEEE Internet Comput. 2021, 25, 51–59. [Google Scholar] [CrossRef]
  24. Chen, P.H.; Lu, Y.; Zheng, V.W.; Chen, X.; Yang, B. KnowEdu: A System to Construct Knowledge Graph for Education. IEEE Access 2018, 6, 31553–31563. [Google Scholar] [CrossRef]
  25. Jia, B.X.; Huang, X.; Jiao, S. Application of Semantic Similarity Calculation Based on Knowledge Graph for Personalized Study Recommendation Service. Educ. Sci. Theory Pract. 2018, 18, 2958–2966. [Google Scholar]
  26. Nayyeri, M.; Cil, G.M.; Vahdati, S.; Osborne, F.; Rahman, M.; Angioni, S.; Salatino, A.; Reforgiato Recupero, D.; Vassilyeva, N.; Motta, E.; et al. Trans4E: Link Prediction on Scholarly Knowledge Graphs. Neurocomputing 2021, 461, 530–542. [Google Scholar] [CrossRef]
  27. Chi, Y.; Qin, Y.; Song, R.; Xu, H. Knowledge Graph in Smart Education: A Case Study of Entrepreneurship Scientific Publication Management. Sustainability 2018, 10, 995. [Google Scholar] [CrossRef] [Green Version]
  28. Balažević, I.; Allen, C.; Hospedales, T.M. Tucker: Tensor factorization for knowledge graph completion. arXiv 2019, arXiv:1901.09590:1-10. [Google Scholar]
  29. Pazzani, M.; Billsus, D. Learning and Revising User Profiles: The Identification of Interesting Web Sites. Mach. Learn. 1997, 27, 313–331. [Google Scholar] [CrossRef]
  30. Symeonidis, P. ClustHOSVD: Item Recommendation by Combining Semantically Enhanced Tag Clustering with Tensor HOSVD. IEEE Trans. Syst. Man Cybern. Syst. 2015, 46, 1240–1251. [Google Scholar] [CrossRef]
  31. Li, H.; Hu, X.; Lin, Y.; He, W.; Pan, J. A Social Tag Clustering Method Based on Common Co-occurrence Group Similarity. Front. Inf. Technol. Electron. Eng. 2016, 17, 122–134. [Google Scholar] [CrossRef]
  32. Kolda, T.G.; Bader, B.W. Tensor Decompositions and Applications. Coll. Res. Libr. 2005, 66, 294–310. [Google Scholar] [CrossRef]
Figure 1. A dynamic generation framework of STEAM knowledge graphs.
Figure 1. A dynamic generation framework of STEAM knowledge graphs.
Applsci 12 11001 g001
Figure 2. Dynamic completion model of STEAM knowledge graph based on tensor decomposition.
Figure 2. Dynamic completion model of STEAM knowledge graph based on tensor decomposition.
Applsci 12 11001 g002
Figure 3. Interdisciplinary knowledge graph automatically generated based on keyword “peas”.
Figure 3. Interdisciplinary knowledge graph automatically generated based on keyword “peas”.
Applsci 12 11001 g003
Figure 4. Simulation experiment results of the P-R curve and F1 index curve of the dataset under four algorithms.
Figure 4. Simulation experiment results of the P-R curve and F1 index curve of the dataset under four algorithms.
Applsci 12 11001 g004
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ke, Q.; Lin, J. Dynamic Generation of Knowledge Graph Supporting STEAM Learning Theme Design. Appl. Sci. 2022, 12, 11001. https://doi.org/10.3390/app122111001

AMA Style

Ke Q, Lin J. Dynamic Generation of Knowledge Graph Supporting STEAM Learning Theme Design. Applied Sciences. 2022; 12(21):11001. https://doi.org/10.3390/app122111001

Chicago/Turabian Style

Ke, Qingchao, and Jian Lin. 2022. "Dynamic Generation of Knowledge Graph Supporting STEAM Learning Theme Design" Applied Sciences 12, no. 21: 11001. https://doi.org/10.3390/app122111001

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop