{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:43:40Z","timestamp":1777704220089,"version":"3.51.4"},"reference-count":17,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T00:00:00Z","timestamp":1528934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2018,10]]},"abstract":"<jats:p>Intelligent exercise recommendation is a research focus in the field of online learning that can help learners quickly find exercises suitable for them from the exercise bank. However, exercise recommendation differs from product or film recommendation because of some special requirements. First, the recommended exercises must cover all knowledge points geared toward the learning objective of the learner. Second, the difficulty of exercises must match the knowledge level of the target learner. In response to the above requirements, this study proposes an exercise recommendation algorithm that integrates learning objective and assignment feedback. This algorithm considers not only the coverage of knowledge points but also the knowledge level of learners to help them find highly suitable exercises. According to this algorithm, the learning objective of the learner must be initially identified to obtain a course knowledge set that suits his\/her learning objective. Second, the understanding of the learner about the knowledge set must be judged based on the assignment feedback. Third, suitable exercises are recommended based on the knowledge level of the learner and the course knowledge structure. The proposed algorithm is experimentally verified by using a real-world dataset and by comparing it with other algorithms. The experimental results show that the proposed algorithm significantly outperforms the other algorithms in both precision and recall. Based on these results, the proposed algorithm can achieve an excellent recommendation performance.<\/jats:p>","DOI":"10.3233\/jifs-169652","type":"journal-article","created":{"date-parts":[[2018,6,15]],"date-time":"2018-06-15T13:17:54Z","timestamp":1529068674000},"page":"2965-2973","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":19,"title":["Personalized exercise recommendation algorithm combining learning objective and assignment feedback"],"prefix":"10.1177","volume":"35","author":[{"given":"Jiali","family":"Xia","sequence":"first","affiliation":[{"name":"School of Information Management, Jiangxi University of Finance and Economics, Nanchang, China"}]},{"given":"Guangquan","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information Management, Jiangxi University of Finance and Economics, Nanchang, China"},{"name":"School of Computer and Information Engineering, Jiangxi Agriculture University, Nanchang, China"}]},{"given":"Zhonghua","family":"Cao","sequence":"additional","affiliation":[{"name":"School of Information Management, Jiangxi University of Finance and Economics, Nanchang, China"}]}],"member":"179","published-online":{"date-parts":[[2018,6,14]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-015-9440-z"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2009.01.008"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10639-012-9245-5"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1087.2013.01950"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2010.08.007"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","unstructured":"BousbahiF and ChorfiH. MOOC-Rec: A case based recommender system for MOOCs Procedia-Social and Behavioral Sciences (195) (2015) 1813\u20131822.","DOI":"10.1016\/j.sbspro.2015.06.395"},{"issue":"01","key":"e_1_3_2_9_2","first-page":"176","article-title":"Cognitive Diagnosis Based Personalized Question Recommendation","volume":"40","author":"Zhu T.Y.","year":"2017","unstructured":"ZhuT.Y., HuangZ.Y., ChenE.H.et al., Cognitive Diagnosis Based Personalized Question Recommendation, Chinese Journal of Computers40(01) (2017), 176\u2013191.","journal-title":"Chinese Journal of Computers"},{"key":"e_1_3_2_10_2","unstructured":"JiangC.F. FengJ. SunX.et al. Personalized Exercises Recommendation Algorithm based on Knowledge Hierarchical Graph Computer Engineering and Applications (4) (2017) 1\u20139."},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1041.2013.01295"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.3102\/1076998607309474"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1177\/0146621613479818"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1080\/01443410.2016.1166176"},{"key":"e_1_3_2_15_2","doi-asserted-by":"crossref","unstructured":"DurandG. BelacelN. and LaPlanteF. Graph theory based model for learning path recommendation Information Sciences (251) (2013) 10\u201321.","DOI":"10.1016\/j.ins.2013.04.017"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1002\/sce.3730670511"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.25103\/jestr.091.02"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.2507\/IJSIMM15(1)7.326"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169652","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-169652","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:40:43Z","timestamp":1777455643000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-169652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,14]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["10.3233\/JIFS-169652"],"URL":"https:\/\/doi.org\/10.3233\/jifs-169652","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,14]]}}}