Skip to content
naulon
Not checkedNot checked for notices yet.

Personalized Learning Task Assignment Based on Bipartite Graph

TAN Zhen-qiong, JIANG Wen-Jun, YUM Yen-na-cherry, ZHANG Ji, YUM Peter-tak-shing, LI Xiao-hong

Jisuanji kexue · 2022

doi:10.11896/jsjkx.210500125 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

“Learning” is a complex event.Individual's learning effect is affected by many factors.Moreover, different individuals have different learning habits.Therefore, it is challenging for students to plan their learning schedule reasonably according to their own characteristics.Although some general theoretical strategies for task management have been proposed, the differences among individuals are usually neglected.Furthermore, existing research cannot provide a calculation method to form a specific task mana-gement schedule.To this end, this paper tries to explore students'learning characteristics by deeply studying the relation between learning efficiency and time factor through data analysis.Based on this, it quantifies personalized learning efficiency.Furthermore, it exploits the bipartite graph method to construct the learning task assignment scenario, and designs adaptive utility function according to different learning goals.Then, a dynamic allocation algorithm TLTA based on transfer learning is proposed to formulate a reasonable schedule for students.Finally, a large number of experiments are carried out on real learning datasets, and the results validate the effectiveness and applicability of the proposed work.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.