Author
Listed:
- Zhuo Sun
- Shuang Zhang
- Mairu Liu
- Gengxin Sun
Abstract
Process mining technology aims to automatically generate process models by analyzing events, thereby assisting the design and redesign of process models. Although many process mining methods have appeared, they all have deficiencies. These methods focus on mining from the behavioral aspects described by the log, while ignoring the structural nature of the process model itself. The complexity of the process describes the simplicity and ease of understanding of the process. Higher process complexity affects the readability of the process. Genetic programming has strong robustness. Its individual representation based on tree structure can describe the special structure of the process. The introduction of process complexity fitness enables it to consider the complexity of the process model itself while mining log behavior, so as to achieve nonlinear mining of complex processes. This paper analyzes the process mining based on genetic programming and proposes process individuals based on tree structure. By realizing the combination of process complexity measurement and process mining technology, noncomplex process mining can be realized. In this paper, the process complexity is combined with the process mining algorithm based on genetic programming, and a measure of process structural complexity is proposed, which is converted into complexity fitness and introduced into the fitness function of genetic programming, to realize the use of genetic programming. The research results show that the improved new adaptive genetic programming robust scheduling algorithm provides a new idea and method for the evaluation of college sports under different sports conditions. This makes the college sports evaluation management system more intelligent and improves the rational allocation of physical education teaching.
Suggested Citation
Zhuo Sun & Shuang Zhang & Mairu Liu & Gengxin Sun, 2022.
"Education Teaching Evaluation Method Aided by Adaptive Genetic Programming and Robust Scheduling,"
Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-13, April.
Handle:
RePEc:hin:jnlmpe:2245666
DOI: 10.1155/2022/2245666
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:2245666. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.