CN116862727A - Teaching management method based on dynamic planning - Google Patents
Teaching management method based on dynamic planning Download PDFInfo
- Publication number
- CN116862727A CN116862727A CN202310821576.3A CN202310821576A CN116862727A CN 116862727 A CN116862727 A CN 116862727A CN 202310821576 A CN202310821576 A CN 202310821576A CN 116862727 A CN116862727 A CN 116862727A
- Authority
- CN
- China
- Prior art keywords
- teaching
- knowledge
- duration
- knowledge point
- knowledge points
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000007726 management method Methods 0.000 title claims abstract description 14
- 238000012552 review Methods 0.000 claims abstract description 41
- 238000000034 method Methods 0.000 claims abstract description 24
- 238000007619 statistical method Methods 0.000 claims abstract description 7
- 238000012216 screening Methods 0.000 claims description 4
- 238000012546 transfer Methods 0.000 claims description 3
- 230000007704 transition Effects 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 6
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000002360 preparation method Methods 0.000 description 2
- 238000001914 filtration Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/20—Education
- G06Q50/205—Education administration or guidance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/70—Information retrieval; Database structures therefor; File system structures therefor of video data
- G06F16/73—Querying
- G06F16/735—Filtering based on additional data, e.g. user or group profiles
Abstract
The application relates to the field of education assistance, in particular to a teaching management method based on dynamic planning. A teaching management method based on dynamic programming comprises the following steps: s1, acquiring all knowledge points to be reviewed in the current period; s2, obtaining a knowledge point X in a statistical analysis mode n Corresponding teaching duration T n The method comprises the steps of carrying out a first treatment on the surface of the S3, learning information of all students in a preset time is obtained, and a knowledge point X is generated according to the learning information n Corresponding review value W n The method comprises the steps of carrying out a first treatment on the surface of the S4, acquiring knowledge points X n Corresponding teaching duration T n And review value W n Generating a teaching plan through a dynamic planning algorithm. According to the application, weight assignment is carried out on the knowledge points according to the learning information, and a teaching plan is generated through a dynamic planning algorithm, so that the knowledge points to be reviewed are more fit with the situation of students, and a better review effect is achieved in the review process.
Description
Technical Field
The application relates to the field of education assistance, in particular to a teaching management method based on dynamic planning.
Background
In the process of on-line education, a teacher often needs to spend one lesson or two lessons to lead the students to review the learned content. The process of review generally takes knowledge points as a reference, but because of the tension of learning time, all knowledge cannot be considered in the process of review, so a teacher is required to choose and reject the knowledge points in the course of lesson preparation, and the teacher generally selects the knowledge points to be reviewed according to own teaching experience, but the actual situation of students is not considered in the mode, so that the review effect is not ideal.
Disclosure of Invention
The application provides a teaching management method based on dynamic programming, which carries out weight assignment on knowledge points according to learning information, and generates a teaching plan through a dynamic programming algorithm, so that the knowledge points to be reviewed are more suitable for students, and a better review effect is achieved in the review process.
A teaching management method based on dynamic programming comprises the following steps:
s1: all knowledge points to be reviewed in the current period are obtained and marked as Xn, n=1, 2, 3;
s2: knowledge point X is obtained by means of statistical analysis n Corresponding teaching duration T n ；
S3: acquiring learning information of all students in a preset time, and generating a knowledge point X according to the learning information n Corresponding review value W n ；
S4: acquiring knowledge point X n Corresponding teaching duration T n And review value W n Generating a teaching plan through a dynamic planning algorithm, wherein the teaching plan comprises knowledge points to be reviewed and reference time corresponding to the knowledge points.
As a preference of the application, knowledge points X are obtained by means of statistical analysis n Corresponding teaching duration T n The method specifically comprises the following steps: acquiring each knowledge point X n All the corresponding teaching videos; acquiring a first tag set input by a user, selecting teaching videos one by one, matching the first tag set with a second tag set corresponding to the teaching videos aiming at each selected teaching video, and firstlyThe second tag sets corresponding to the teaching videos comprise user tags, wherein the user tags refer to teaching style related words corresponding to teaching teachers in the teaching videos, video style similarity delta=Q/P is calculated, Q refers to the number of repeated user tags in the first tag set and the second tag set, P refers to the total number of all user tags in the first tag set, delta is less than or equal to 1, whether delta is equal to alpha is judged, alpha is a similarity threshold, if delta is equal to alpha, the teaching videos are reserved, if delta is not equal to alpha, the teaching videos are deleted, screening is carried out on the teaching videos, and all the teaching videos reserved after screening form a reference video set; calculating the average value of all teaching video time in the reference video set, and taking the average value as a knowledge point X n Corresponding teaching duration T n 。
As a preferred embodiment of the present application, knowledge points X are generated based on learning information n Corresponding review value W n The method comprises the following steps: selecting knowledge points X one by one n For each selected knowledge point X n According to knowledge point X n Matching the corresponding content with the learning information, and acquiring a knowledge point X n All learning information successfully matched and calculating review value W n ＝W 0 (exp (. Beta./BETA.) -1) wherein W 0 To review the value reference value, the user sets in advance, beta is the knowledge point X n The number of paired learning information out of all successfully matched learning information, BETA is knowledge point X n The total number of all learning information that match successfully.
As a preferred aspect of the present application, generating a teaching plan by a dynamic planning algorithm specifically includes the steps of: acquiring knowledge point X n Corresponding teaching duration T n And review value W n Constructing a state transition equation dp [ i ]][ψ]＝max{dp[i-1][ψ]，dp[i-1][ψ-T i ]+W i }, wherein dp [ i ]][ψ]The method is characterized in that knowledge points are arbitrarily selected from the previous i knowledge points to be combined, the total review value of all knowledge points with total teaching duration not exceeding psi is more than 0 and less than or equal to N, psi is the total teaching duration, psi is less than or equal to psi, and psi is the total duration of a lesson; by state transfer equationCalculating dp [ i ] when ψ=ψ][ψ]All knowledge points corresponding to the maximum are combined according to dp [ i ]][ψ]And constructing a teaching plan by all knowledge points corresponding to the maximum.
As a preferred aspect of the present application, the present application further comprises: acquiring knowledge point X uploaded by user n Corresponding standard teaching video, and taking the duration of the standard teaching video as a knowledge point X n Corresponding teaching duration.
The application has the following advantages:
according to the application, weight assignment is carried out on the knowledge points according to the learning information, and a teaching plan is generated through a dynamic planning algorithm, so that the knowledge points to be reviewed are more fit with the situation of students, and a better review effect is achieved in the review process.
Drawings
Fig. 1 is a flow chart of a teaching management method based on dynamic programming according to an embodiment of the present application.
Detailed Description
In order to enable those skilled in the art to better understand the technical solution of the present application, the technical solution of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application.
Example 1
A teaching management method based on dynamic programming, see fig. 1, comprising the following steps:
s1: all knowledge points to be reviewed in the current period are acquired and marked as X n N=1, 2, 3.N, the knowledge points can be from operators, i.e. teachers select inputs on the operation interface, or by inputting the learning progress (which means a period of time before the review is about to be performed), matching the corresponding knowledge points according to the learning progress;
s2: knowledge point X is obtained by means of statistical analysis n Corresponding teaching duration T n The method comprises the steps of carrying out a first treatment on the surface of the The time spent by different knowledge points in review is different according to the complexity of the knowledge points, and the teaching time is a main factor for restricting the choice of the knowledge points to be reviewed;
knowledge point X is obtained by means of statistical analysis n Corresponding teaching duration T n The method specifically comprises the following steps: acquiring each knowledge point X n All the corresponding teaching videos are derived from related videos uploaded by other teachers; acquiring a first tag set input by a user, selecting teaching videos one by one, matching the first tag set with a second tag set corresponding to the teaching videos aiming at each selected teaching video, wherein the second tag set corresponding to the first tag set and the teaching videos comprises user tags, the user tags refer to teaching style related words corresponding to teaching teachers in the teaching videos, such as speed of speech and the like, calculating video style similarity delta=Q/P, wherein Q refers to the number of repeated user tags in the first tag set and the second tag set, P refers to the total number of all user tags in the first tag set, delta is less than or equal to 1, judging whether delta is equal to alpha, setting by a user, modifying the similarity threshold by modifying a configuration file, if so, the similarity of the style of the user to the teaching videos is high, the teaching videos are reserved, if so, the similarity of the style of the user to the teaching videos is not high, and if the style of the user to the teaching videos is not high, deleting the teaching videos, and filtering the teaching videos by the reference value, and then forming the teaching video is not reserved; calculating the average value of all teaching video time in the reference video set, and taking the average value as a knowledge point X n Corresponding teaching duration T n The method comprises the steps of carrying out a first treatment on the surface of the The teaching video similar to the teaching style of the user is matched through the user tag, and the knowledge point X is obtained by referring to the teaching video n Corresponding teaching duration T n The teaching duration corresponding to the knowledge points is more suitable for the user, and the subsequent teaching plan generation process is more accurate.
S3: acquiring learning information of all students in a preset time, wherein the learning information comprises post-class homework of the students and the like, and generating a knowledge point X according to the learning information n Corresponding review value W n The method comprises the steps of carrying out a first treatment on the surface of the Weighting knowledge points by review valueThe actual situation of the students is considered, so that the reviewed knowledge points are more attached to the students, and the review effect is better;
generating knowledge points X from learning information n Corresponding review value W n The method comprises the following steps: selecting knowledge points X one by one n For each selected knowledge point X n According to knowledge point X n The corresponding content is matched with the learning information in a keyword matching mode, and then a knowledge point X is obtained n All learning information successfully matched and calculating review value W n ＝W 0 (exp (. Beta./BETA.) -1) wherein W 0 To review the value reference value, the user sets in advance, beta is the knowledge point X n The number of paired learning information out of all successfully matched learning information, BETA is knowledge point X n The total number of all learning information successfully matched; the review value corresponding to the knowledge points is confirmed through the learning information of the students, namely the completion condition of the problems after the class;
s4: acquiring knowledge point X n Corresponding teaching duration T n And review value W n Generating a teaching plan through a dynamic programming algorithm, wherein the teaching plan comprises knowledge points to be reviewed and reference time corresponding to the knowledge points, and the reference time is derived from the knowledge point X n Corresponding teaching duration T n The method comprises the steps of carrying out a first treatment on the surface of the In the process of generating a teaching plan through a dynamic planning algorithm, taking the total duration of one lesson or two lessons as a constraint condition, and taking the highest review value as a target;
the generation of the teaching plan by the dynamic planning algorithm specifically comprises the following steps: acquiring knowledge point X n Corresponding teaching duration T n And review value W n Constructing a state transition equation dp [ i ]][ψ]＝max{dp[i-1][ψ]，dp[i-1][ψ-T i ]+W i }, wherein dp [ i ]][ψ]The method is characterized in that knowledge points are arbitrarily selected from the previous i knowledge points to be combined, the total review value of all knowledge points with total teaching duration not exceeding psi is more than 0 and less than or equal to N, psi is the total teaching duration, psi is less than or equal to psi, and psi is the total duration of a lesson; calculating dp [ i ] when ψ=ψ by state transfer equation][ψ]All knowledge point combinations corresponding to the maximum according to dp[i][ψ]And constructing a teaching plan by all knowledge points corresponding to the maximum.
According to the application, weight assignment is carried out on the knowledge points according to the learning information, and a teaching plan is generated through a dynamic planning algorithm, so that the knowledge points to be reviewed are more fit with the situation of students, and a better review effect is achieved in the review process.
Considering that the teaching duration always has deviation when the teaching video uploaded by other teachers is confirmed, the application further comprises the following steps: acquiring knowledge point X uploaded by user n Corresponding standard teaching video, and taking the duration of the standard teaching video as a knowledge point X n Corresponding teaching duration; through the user in advance lessons preparation, simulation teaching and recording of teaching video, the duration corresponding to the teaching video can be more matched with the user.
It will be understood that modifications and variations will be apparent to those skilled in the art from the foregoing description, and it is intended that all such modifications and variations be included within the scope of the following claims. Parts of the specification not described in detail belong to the prior art known to those skilled in the art.
Claims (5)
1. The teaching management method based on dynamic programming is characterized by comprising the following steps:
s1: all knowledge points to be reviewed in the current period are obtained and marked as Xn, n=1, 2, 3;
s2: knowledge point X is obtained by means of statistical analysis n Corresponding teaching duration T n ；
S3: acquiring learning information of all students in a preset time, and generating a knowledge point X according to the learning information n Corresponding review value W n ；
S4: acquiring knowledge point X n Corresponding teaching duration T n And review value W n Generating a teaching plan through a dynamic planning algorithm, wherein the teaching plan comprises knowledge points to be reviewed and reference time corresponding to the knowledge points.
2. According to the weightsThe teaching management method based on dynamic programming as claimed in claim 1, wherein knowledge points X are obtained by means of statistical analysis n Corresponding teaching duration T n The method specifically comprises the following steps: acquiring each knowledge point X n All the corresponding teaching videos; acquiring a first tag set input by a user, selecting teaching videos one by one, matching the first tag set with a second tag set corresponding to the teaching videos aiming at each selected teaching video, wherein the second tag set corresponding to the first tag set and the teaching videos comprises user tags, the user tags refer to teaching style related words corresponding to teaching teachers in the teaching videos, calculating video style similarity delta=Q/P, wherein Q refers to the number of repeated user tags in the first tag set and the second tag set, P refers to the total number of all user tags in the first tag set, delta is less than or equal to 1, judging whether delta is more than or equal to alpha, wherein alpha is a similarity threshold, if delta is more than or equal to alpha, reserving the teaching videos, if delta is not more than alpha, deleting the teaching videos, screening the teaching videos, and forming a reference video set from all the reserved teaching videos after screening; calculating the average value of all teaching video time in the reference video set, and taking the average value as a knowledge point X n Corresponding teaching duration T n 。
3. The teaching management method based on dynamic programming according to claim 2, wherein knowledge points X are generated according to learning information n Corresponding review value W n The method comprises the following steps: selecting knowledge points X one by one n For each selected knowledge point X n According to knowledge point X n Matching the corresponding content with the learning information, and acquiring a knowledge point X n All learning information successfully matched and calculating review value W n ＝W 0 (exp (. Beta./BETA.) -1) wherein W 0 To review the value reference value, the user sets in advance, beta is the knowledge point X n The number of paired learning information out of all successfully matched learning information, BETA is knowledge point X n The total number of all learning information that match successfully.
4. A teaching management method based on dynamic programming according to claim 3, characterized in that generating a teaching plan by means of a dynamic programming algorithm comprises the following steps: acquiring knowledge point X n Corresponding teaching duration T n And review value W n Constructing a state transition equation dp [ i ]][ψ]＝max{dp[i-1][ψ]，dp[i-1][ψ-T i ]+W i }, wherein dp [ i ]][ψ]The method is characterized in that knowledge points are arbitrarily selected from the previous i knowledge points to be combined, the total review value of all knowledge points with total teaching duration not exceeding psi is more than 0 and less than or equal to N, psi is the total teaching duration, psi is less than or equal to psi, and psi is the total duration of a lesson; calculating dp [ i ] when ψ=ψ by state transfer equation][ψ]All knowledge points corresponding to the maximum are combined according to dp [ i ]][ψ]And constructing a teaching plan by all knowledge points corresponding to the maximum.
5. The teaching management method based on dynamic programming according to claim 4, further comprising: acquiring knowledge point X uploaded by user n Corresponding standard teaching video, and taking the duration of the standard teaching video as a knowledge point X n Corresponding teaching duration.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310821576.3A CN116862727A (en) | 2023-07-06 | 2023-07-06 | Teaching management method based on dynamic planning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310821576.3A CN116862727A (en) | 2023-07-06 | 2023-07-06 | Teaching management method based on dynamic planning |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116862727A true CN116862727A (en) | 2023-10-10 |
Family
ID=88227937
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310821576.3A Pending CN116862727A (en) | 2023-07-06 | 2023-07-06 | Teaching management method based on dynamic planning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116862727A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150363795A1 (en) * | 2014-06-11 | 2015-12-17 | Michael Levy | System and Method for gathering, identifying and analyzing learning patterns |
| CN113094495A (en) * | 2021-04-21 | 2021-07-09 | 上海松鼠课堂人工智能科技有限公司 | Learning path demonstration method, device, equipment and medium for deep reinforcement learning |
| CN113516574A (en) * | 2021-07-27 | 2021-10-19 | 北京爱学习博乐教育科技有限公司 | Self-adaptive learning system based on big data and deep learning and construction method thereof |
| CN113851020A (en) * | 2021-11-04 | 2021-12-28 | 华南师范大学 | Self-adaptive learning platform based on knowledge graph |
| CN116340624A (en) * | 2023-03-17 | 2023-06-27 | 华中师范大学 | Self-adaptive learning information recommendation method, device, equipment and storage medium |
-
2023
- 2023-07-06 CN CN202310821576.3A patent/CN116862727A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150363795A1 (en) * | 2014-06-11 | 2015-12-17 | Michael Levy | System and Method for gathering, identifying and analyzing learning patterns |
| CN113094495A (en) * | 2021-04-21 | 2021-07-09 | 上海松鼠课堂人工智能科技有限公司 | Learning path demonstration method, device, equipment and medium for deep reinforcement learning |
| CN113516574A (en) * | 2021-07-27 | 2021-10-19 | 北京爱学习博乐教育科技有限公司 | Self-adaptive learning system based on big data and deep learning and construction method thereof |
| CN113851020A (en) * | 2021-11-04 | 2021-12-28 | 华南师范大学 | Self-adaptive learning platform based on knowledge graph |
| CN116340624A (en) * | 2023-03-17 | 2023-06-27 | 华中师范大学 | Self-adaptive learning information recommendation method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Heslin et al. | Self-efficacy | |
| CN108614865B (en) | Personalized learning recommendation method based on deep reinforcement learning | |
| US20220398486A1 (en) | Learning content recommendation system based on artificial intelligence learning and operating method thereof | |
| CN108182394A (en) | Training method, face identification method and the device of convolutional neural networks | |
| CN110704732A (en) | Cognitive diagnosis-based time-sequence problem recommendation method | |
| US20080206731A1 (en) | Apparatus, Method and Computer Program for Compiling a Test as Well as Apparatus, Method and Computer Program for Testing an Examinee | |
| CN106095812A (en) | Intelligent test paper generation method based on similarity measurement | |
| CN108230797A (en) | A kind of interactive assisted learning method and system | |
| CN110728182A (en) | Interviewing method and device based on AI interviewing system and computer equipment | |
| Rajendran | Importance Of Using Generative AI In Education: Dawn of a New Era | |
| CN111091493A (en) | Image translation model training method, image translation method and device and electronic equipment | |
| CN113283488B (en) | Learning behavior-based cognitive diagnosis method and system | |
| CN108764149B (en) | Training method for class student face model | |
| CN109840867B (en) | Intelligent teaching method, equipment and device | |
| CN116862727A (en) | Teaching management method based on dynamic planning | |
| Dlamini et al. | Evaluating machine learning techniques for improved adaptive pedagogy | |
| US20220101088A1 (en) | Training neural networks for an efficient implementation on hardware | |
| CN105678771A (en) | Determination method and device for determining quality scores of images | |
| TW201816706A (en) | Planning method for learning and planning system for learning with automatic mechanism of generating personalized learning path | |
| US20220284315A1 (en) | Apparatus and system for training knowledge tracking model based on data augmentation and operation method thereof | |
| CN109858006A (en) | Subject recognition training method, apparatus | |
| CN112906293B (en) | Machine teaching method and system based on review mechanism | |
| Agarwal et al. | Contextual Derivation of Stable BKT Parameters for Analysing Content Efficacy. | |
| YURTKAN et al. | Student Success Prediction Using Feedforward Neural Networks | |
| CN113723233A (en) | Student learning participation degree evaluation method based on layered time sequence multi-example learning |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |