METHOD AND PLATFORM FOR OPTIMIZING LEARNING AND LEARNING RESOURCE AVAILABILITY

• US 20130022953A1
• Filed: 07/11/2012
• Published: 01/24/2013
• Est. Priority Date: 07/11/2011
• Status: Abandoned Application

• Current Assignee: McGraw-Hill School Education, LLC
• Original Assignee: MHE Criterion LLC
• Inventors: van der Linden, Wim J., Diao, Qi, Li, Jie
• Application Number:
  US13/546,542
• Publication Number:
  US 20130022953A1
• Time in Patent Office: Days
• US Class Current: 434/322
• CPC Class Codes: G09B 7/02 of the type wherein the student is expected to construct an answer to the question which is presented or wherein the machine gives an answer to the question presented by a student

Abstract

A platform and method for improving learning within a learning model uses a mathematical optimization algorithm to maximize learning gains through efficient resource allocation that accounts for practical constraints, such as teacher or other resource availability, and probability of success for individual learners on learning nodes given learner profile and resource and instructional configurations. One practical output from this platform and method is a schedule that contains an assignment of learners to learning nodes and teaching resources by learning session over the course of several days.

Claims

1-10. -10. (canceled)

11. A computer-implemented method for automated optimization of learning content delivery and learning resource allocation comprising:

(a) identifying a plurality of input data;

(b) pre-processing said plurality of input data via a data pre-processing module into a series of possible input data combinations;

(c) assigning a utility value to each possible data combination;

(d) utilizing said utility values to optimally allocate learning resources and learning content for one or more students via a mathematical optimization algorithm;

(e) generating an assignment schedule reflecting said optimal allocation for said one or more students; and

(f) exporting said assignment schedule to an end user.

12. The computer-implemented method of claim 11, wherein said input data includes one or more learning models, one or more learning modalities, and one or more learning constraints.

13. The computer-implemented method of claim 11, wherein said data pre-processing step comprises the steps of:

a) identifying each student available for scheduling;

b) identifying learning content available for each student; and

c) identifying the mastery status of said learning content for each student.

14. The computer-implemented method of claim 11, wherein said data-preprocessing further comprises storing data wherein data corresponding to one or more students and said one or more students'"'"' learning progression data is stored.

15. The computer-implemented method of claim 11, wherein said mathematical optimization algorithm is configured to generate an optimal allocation of learning resources and learning content for one or more learning periods.

16. The computer-implemented method of claim 11, further comprising a data post-processing step, occurring after said assignment schedule is generated, wherein the allocation of learning resources and learning content for each said one or more students'"'"' assignment schedule is stored in a data store, and wherein the optimization algorithm may utilize the stored allocation of learning resources and learning content to automatically weight said utility values assigned by the pre-processing step to adjust the likelihood that the optimization algorithm will assign a particular data combination.

17. The computer-implemented method of claim 11, further comprising:

assigning a utility values in the pre-processing step to adjust the likelihood that the optimization algorithm will assign a particular data combination.

18. The computer-implemented method of claim 15, further comprising controlling with said mathematical optimization algorithm, the interaction between:

(a) a mathematical model file that includes at least mathematical formulas and at least configuration information required to solve said optimization algorithm;

(b) a resource configuration file that includes input data reflecting learning resource and learning delivery constraints; and

(c) a student-learning content utility file that includes an identifier for said one or more students, the possible learning content available to the one or more students, and the utility value assigned to each combination of student and learning content.

19. The computer-implemented method of claim 11, further comprising utilizing learning assessments in conjunction with said mathematical optimization algorithm to generate input data.

20. The computer-implemented method of claim 11, further comprising enabling said assignment schedule to be manually varied by an end user from the assignment schedule reflecting said optimal allocation for one or more students into an alternate configuration.

21. The computer-implemented method of claim 18, further comprising automatically updating said resource configuration file and said student-learning content utility file based on a determination of mastery or non-mastery for each student-learning content combination.

22. A computer-implemented method for automated optimization of learning content delivery and learning resource allocation comprising:

(a) identifying input data comprising a plurality of students to be assigned a schedule, the learning content available to be assigned to said plurality of students, and the learning modalities available to teach said plurality of students said learning content;

(b) pre-processing said input data to generate one or more student-learning content-learning modality combinations for each student;

(c) assigning each student-learning content-learning modality combination a utility value;

(d) utilizing a mathematical optimization algorithm to generate an assignment schedule by selecting a student-learning content-learning modality combination that maximizes the total sum of utility values for all students;

(e) storing each selected student-learning content-learning modality combination in a data store;

(f) exporting said assignment schedule to an end user; and

(g) updating said stored student-learning content-learning modality combination to reflect mastery or non-mastery of said student-learning content-learning modality combination following each student mastery attempt.

23. The computer-implemented method of claim 22, further comprising enabling said assignment schedule generated by selecting a student-learning content-learning modality combination that maximizes the total sum of utility values for all students to be manually varied by an end user into an alternate configuration.

24. The computer-implemented method of claim 22, further comprising enabling said optimization algorithm to utilize stored mastery or non-mastery determinations for each student-learning content-learning modality combination to automatically weight said utility values to adjust the likelihood that the optimization algorithm will select a particular learning content-learning modality combination to an individual student.

25. A computer-implemented method for automated optimization of learning content delivery and learning resource allocation to a plurality of students, wherein the learning content comprises a plurality of learning targets, said method comprising:

A. providing, as input, data relating to;

1. learning modalities for delivering instruction relating to learning content

2. learning resources available for delivery of the instruction;

3. at least one learning model for the content which expresses interrelationships between the learning targets;

4. proficiency status of each student for each of the learning targets of the content;

B. with a computerized optimization algorithm, manipulating the input data provided in step A to automatically generate, for each student, a schedule of learning content delivery comprising;

1. at least one unlearned learning target for which the student is not presently proficient;

2. a learning modality by which instruction relating to said unlearned learning target will be delivered to the student; and

3. a learning resource with which instruction relating to said unlearned learning target will be delivered to the student;

C. delivering instruction relating to the unlearned learning target to each student in accordance with each student'"'"'s schedule generated in step B;

D. after step C, assessing each student'"'"'s proficiency in the unlearned learning target included in the schedule generated in step B; and

E. updating the input data relating to the proficiency of each student for the unlearned learning target.

26. The method of claim 25, further comprising, after step E, repeating steps A through D at least one time.

27. The method of claim 26, wherein, if the student is determined in step D to be non-proficient in the unlearned learning target, the input data is adjusted when step A is repeated to increase the likelihood that the schedule generated when step B is repeated will comprise the same unlearned learning target with at least one different learning modality or learning resource.

28. The method of claim 26, wherein, if the student is determined in step D to be proficient in the unlearned learning target, the input data is adjusted when step A is repeated to increase the likelihood that the schedule generated when step B is repeated will comprise a new, unlearned learning target for which the student is not presently proficient.

29. The method of claim 25, further comprising assigning a unique utility value for each learning modality for each learning target such that when the input data is manipulated during step B, the magnitude of the utility value will influence the likelihood that the schedule will include a particular learning modality for a particular learning target.

30. The method of claim 29, wherein if the student is determined in step D to be non-proficient in the unlearned learning target, the utility value assigned to each modality for the unlearned learning target is adjusted to influence the likelihood that a subsequently generated schedule will include a different learning modality for delivering instruction relating to the unlearned learning target.

31. The method of claim 25, wherein the input data relating to learning resources available for delivery of the instruction comprises constraints applied by the computerized optimization algorithm in step B to influence the likelihood that the schedule will include a particular learning resource.