{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T20:10:36Z","timestamp":1779912636343,"version":"3.53.1"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819698745","type":"print"},{"value":"9789819698752","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-9875-2_9","type":"book-chapter","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T09:20:39Z","timestamp":1753089639000},"page":"95-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CMulti-Feature Fusion Method for Programming Exercise Difficulty Assessment Using CodeBERT"],"prefix":"10.1007","author":[{"given":"Sheng","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongqi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinxian","family":"Suo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,22]]},"reference":[{"issue":"04","key":"9_CR1","first-page":"734","volume":"16","author":"J Xu","year":"2022","unstructured":"Xu, J., et al.: Review of question difficulty evaluation approaches. J. Front. Comput. Sci. Technol. 16(04), 734\u2013759 (2022)","journal-title":"J. Front. Comput. Sci. Technol."},{"issue":"08","key":"9_CR2","first-page":"58","volume":"50","author":"TC Jin","year":"2023","unstructured":"Jin, T.C., Dou, L., Zhang, W., et al.: Oj exercise recommendation model based on deep reinforcement analvsis. Comput. Sci. 50(08), 58\u201367 (2023)","journal-title":"Comput. Sci."},{"issue":"01","key":"9_CR3","first-page":"103","volume":"46","author":"TC Jin","year":"2023","unstructured":"Jin, T.C., et al.: Personalized oj exercise recommendation method withmemory and cognition merging. Chin. J. Comput. 46(01), 103\u2013124 (2023)","journal-title":"Chin. J. Comput."},{"issue":"5","key":"9_CR4","first-page":"1007","volume":"56","author":"W Tong","year":"2019","unstructured":"Tong, W., Wang, F., Liu, Q., et al.: Data driven prediction for the difficulty of mathematical items. J. Comput. Res. Dev. 56(5), 1007\u20131019 (2019)","journal-title":"J. Comput. Res. Dev."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1080\/15434303.2019.1674315","volume":"17","author":"I Choi","year":"2020","unstructured":"Choi, I., Moon, Y.: Predicting the difficulty of efl tests based on corpus linguistic features and expert judgment. Lang. Assess. Q. 17(1), 18\u201342 (2020)","journal-title":"Lang. Assess. Q."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Lin, L.H., Chang, T.H., Hsu, F.Y.: Automated prediction of item difficulty in reading comprehension using long shortterm memory[C]\/\/Proceedings of the 2019 International Conference on Asian Language Processing, Shanghai, Nov 15\u201317, 2019. Piscataway: IEEE, pp. 132\u2013135 (2019)","DOI":"10.1109\/IALP48816.2019.9037716"},{"key":"9_CR7","unstructured":"Yaneva, V., Ha, L.A., Baldwin, P., et al.: Predicting item survival for multiple choice questions in a high- stakes medical exam[C]\/\/Proceedings of the 2020 Language Resources and Evaluation Conference, Marseille, May 11\u201316, 2020. Paris: European Language Resources Association, pp. 6812\u20136818 (2020)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Benedetto, L., et al.: R2DE: a NLP approach to estimating IRT parameters of newly generated questions[C]\/\/Proceedings of the 10th International Conference on Learning Analytics and Knowledge, Frankfurt, Mar 23\u201327, 2020. New York: ACM, pp. 412\u2013421 (2020)","DOI":"10.1145\/3375462.3375517"},{"issue":"03","key":"9_CR9","first-page":"1365","volume":"34","author":"Y Wang","year":"2023","unstructured":"Wang, Y., Zhu, M.X., Yang, S.H., et al.: Review and performance comparison of deep knowledge tracing models. J. Softw. 34(03), 1365\u20131395 (2023)","journal-title":"J. Softw."},{"issue":"04","key":"9_CR10","first-page":"81","volume":"55","author":"X Liang","year":"2023","unstructured":"Liang, X., Liu, M.C., Hu, J., et al.: Deep knowledge tracing model by integrating problem difficulty and answering experience. J. South China Normal Univ. (Nat. Sci. Ed.) 55(04), 81\u201386 (2023)","journal-title":"J. South China Normal Univ. (Nat. Sci. Ed.)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Lin, L.H., et al.: Automated prediction of item difficulty in reading comprehension using long shortterm memory[C]\/\/Proceedings of the 2019 International Conference on Asian Language Processing, Shanghai, Nov 15\u201317, 2019. Piscataway: IEEE, 132\u2013135 (2019)","DOI":"10.1109\/IALP48816.2019.9037716"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Qiu, Z.P., Wu, X., Fan, W.: Question difficulty prediction for multiple choice problems in medical exams[C]\/\/Proceedings of the 28th ACM International Conference on Information and Knowledge Management, Beijing, Nov 3\u20137, 2019. New York: ACM, 139\u2013148 (2019)","DOI":"10.1145\/3357384.3358013"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Feng, Z.Y., et al.: Codebert: a pre-trained model for programming and natural languages[J] (2020). arXiv preprint arXiv:2002.08155","DOI":"10.18653\/v1\/2020.findings-emnlp.139"},{"key":"9_CR14","unstructured":"Wang, Z.Y., Zhang, W., Wang, J.: Estimating difficulty levels of programming problems with pre-trained model[J] (2024). arXiv preprint arXiv:2406.08828"},{"key":"9_CR15","unstructured":"Wu, Y., et al.: Google\u2019s neural machine translation system: bridging the gap between human and machine translation[J] (2016). arXiv preprint arXiv:1609.08144"},{"key":"9_CR16","unstructured":"Sennrich, R., Barry, H., Alexandra B.: Neural machine translation of rare words with subword units[J] (2015). arXiv preprint arXiv:1508.07909"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"He, Kaiming, et al.: Deep residual learning for image recognition[C]\/\/Proceedings of the IEEE conference on computer vision and pattern recognition. (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"9_CR18","unstructured":"Ba, Jimmy, L., Jamie, R.K., Geoffrey, E.H.: Layer normalization (2016). arXiv preprint arXiv:1607.06450"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: Xgboost: A scalable tree boosting system[C] Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining, pp. 785\u2013794 (2016)","DOI":"10.1145\/2939672.2939785"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-9875-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T19:46:01Z","timestamp":1779911161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-9875-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819698745","9789819698752"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-9875-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ningbo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/icg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}