{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:13:04Z","timestamp":1757617984320,"version":"3.44.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T00:00:00Z","timestamp":1746230400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T00:00:00Z","timestamp":1746230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62107008","61977015"],"award-info":[{"award-number":["62107008","61977015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10115-025-02438-x","type":"journal-article","created":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T12:45:36Z","timestamp":1746276336000},"page":"7079-7099","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DKFM: a novel data and knowledge fusion-driven model for difficulty prediction of mathematical exercise"],"prefix":"10.1007","volume":"67","author":[{"given":"Zhiyi","family":"Duan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengnian","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Di","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdai","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,3]]},"reference":[{"key":"2438_CR1","unstructured":"Piech C, Bassen J, Huang J, Ganguli S, Sahami M, Guibas LJ, Sohl-Dickstein J (2015) Deep knowledge tracing, Adv Neural Inf Process Syst 505\u2013513"},{"issue":"1","key":"2438_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1027\/\/1015-5759.16.1.3","volume":"16","author":"P Hontangas","year":"2000","unstructured":"Hontangas P, Ponsoda V, Wise SL (2000) The choice of item difficulty in self-adapted testing. Eur J Psychol Assess 16(1):3\u201312","journal-title":"Eur J Psychol Assess"},{"issue":"4","key":"2438_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.jmathb.2004.09.003","volume":"23","author":"J Lithner","year":"2004","unstructured":"Lithner J (2004) Mathematical reasoning in calculus textbook exercises. J Math Behav 23(4):405\u2013427","journal-title":"J Math Behav"},{"issue":"5","key":"2438_CR4","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1177\/001440299205800507","volume":"58","author":"LS Fuchs","year":"1992","unstructured":"Fuchs LS, Fuchs D, Hamlett CL, Ferguson C (1992) Effects of expert system consultation within curriculum-based measurement using a reading maze task. Except Child 58(5):436\u2013450","journal-title":"Except Child"},{"key":"2438_CR5","doi-asserted-by":"crossref","unstructured":"Huang ZY, Liu Q, Zhao EH, Zhao HK, Gao MY, Wei S, Su Y, Hu GP (2017) Question difficulty prediction for READING problems in standard tests, in the 31st AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v31i1.10740"},{"key":"2438_CR6","doi-asserted-by":"crossref","unstructured":"Qiu Z, Wu X, Fan W (2019) Question difficulty prediction for multiple choice problems in medical exams, in the 28th ACM international conference on information and knowledge management","DOI":"10.1145\/3357384.3358013"},{"key":"2438_CR7","unstructured":"Loukina A, Yoon S, Sakano J, Wei YH, Sheehan K (2016) Textual complexity as a predictor of difficulty of listening items in language proficiency tests. In Proceedings of COLING, the 26th international conference on computational linguistics: technical papers, pp. 3245\u20133253"},{"key":"2438_CR8","doi-asserted-by":"crossref","unstructured":"Lin LH, Chang TH, Hsu FY (2019) Automated prediction of item difficulty in reading comprehension using long short-term memory. International conference on Asian language processing, pp. 132\u2013135","DOI":"10.1109\/IALP48816.2019.9037716"},{"issue":"4","key":"2438_CR9","first-page":"361","volume":"49","author":"KD Kubinger","year":"2007","unstructured":"Kubinger KD, Gottschall CH (2007) Item difficulty of multiple choice tests dependant on different item response formats: an experiment in fundamental research on psychological assessment. Psychol Sci 49(4):361","journal-title":"Psychol Sci"},{"key":"2438_CR10","unstructured":"Webb N (2002) Depth-of-knowledge levels for four content areas, Madison Wisconsin Center for Educational Research"},{"key":"2438_CR11","unstructured":"Pollitt A, Marriott C, Ahmed A (2000) Language, contextual and cultural constraints on examination performance. International association for educational assessment"},{"key":"2438_CR12","doi-asserted-by":"crossref","unstructured":"Susanti Y, Nishikawa H, Tokunaga T, Hiroyuki O (2016) Item difficulty analysis of English vocabulary questions, in 8th international conference on computer supported education, pp. 267\u2013274","DOI":"10.5220\/0005775502670274"},{"key":"2438_CR13","doi-asserted-by":"crossref","unstructured":"Alagumalai S, Curtis DD, Classical test theory, in applied Rasch measurement: A book of exemplars. Springer. 1\u201314","DOI":"10.1007\/1-4020-3076-2_1"},{"issue":"4","key":"2438_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.4103\/2395-2296.189670","volume":"2","author":"C Rao","year":"2016","unstructured":"Rao C, Prasad HK, Sajitha K et al (2016) Item analysis of multiple choice questions: assessing an assessment tool in medical students. Int J Edu Psychol Res 2(4):201","journal-title":"Int J Edu Psychol Res"},{"key":"2438_CR15","doi-asserted-by":"crossref","unstructured":"Luger S, Bowles J (2013) Two methods for measuring question difficulty and discrimination in incomplete crowdsourced data, in First AAAI conference on human computation and crowdsourcing, pp. 48\u201349","DOI":"10.1609\/hcomp.v1i1.13129"},{"key":"2438_CR16","unstructured":"Wu R, Liu Q, Liu Y et al (2015) Cognitive modelling for predicting examinee performance, in proceedings of the 24th international conference on artificial intelligence, pp. 1017\u20131024"},{"key":"2438_CR17","doi-asserted-by":"crossref","unstructured":"Liu Y, Liu Q, Wu R et al (2016) Collaborative learning team formation: a cognitive modeling perspective. International conference on database systems for advanced applications, Springer International Publishing","DOI":"10.1007\/978-3-319-32049-6_24"},{"key":"2438_CR18","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1007\/s40593-023-00362-1","volume":"34","author":"S AlKhuzaey","year":"2024","unstructured":"AlKhuzaey S, Grasso F, Payne TR, Tamma V (2024) Text-based question difficulty prediction: a systematic review of automatic approaches. Int J Artif Intell Educ 34:862\u2013914","journal-title":"Int J Artif Intell Educ"},{"key":"2438_CR19","doi-asserted-by":"crossref","unstructured":"Smith E, Greco N, Bosnjak M, Vlachos A (2015) A strong lexical matching method for the machine comprehension test. In proceedings of the 2015 conference on empirical methods in natural language processing, pp. 1693\u20131698","DOI":"10.18653\/v1\/D15-1197"},{"key":"2438_CR20","doi-asserted-by":"crossref","unstructured":"Sachan M, Dubey A, Xing EP, Richardson M (2015) Learning answer entailing structures for machine comprehension. In proceedings of the association for computational linguistics, pp. 239\u2013249","DOI":"10.3115\/v1\/P15-1024"},{"key":"2438_CR21","doi-asserted-by":"crossref","unstructured":"Long J, Zhao H, Pu J et al (2024) Research on the difficulty prediction for questions based on learners\u2019 response, In 5th international conference on education, knowledge and information management, pp. 440\u2013453","DOI":"10.2991\/978-94-6463-502-7_46"},{"key":"2438_CR22","doi-asserted-by":"crossref","unstructured":"Wei L, Hao GS (2024) Knowledge graph based absolute difficulty prediction of multiple choice question, In 9th international conference on electronic technology and information science, pp. 720\u2013727","DOI":"10.1109\/ICETIS61828.2024.10593775"},{"key":"2438_CR23","doi-asserted-by":"crossref","unstructured":"Benedetto L, Aradelli G, Donvito A et al (2024) Using LLMs to simulate students\u2019 responses to exam questions. EMNLP, In findings of the association for computational linguistics, pp 11351\u201311368","DOI":"10.18653\/v1\/2024.findings-emnlp.663"},{"key":"2438_CR24","doi-asserted-by":"crossref","unstructured":"Venktesh V, Akhtar MS, Mohania M, Goyal V (2022) Auxiliary task guided interactive attention model for question difficulty prediction. In international conference on artificial intelligence in education, pp. 477\u2013489","DOI":"10.1007\/978-3-031-11644-5_39"},{"key":"2438_CR25","doi-asserted-by":"crossref","unstructured":"Cui Y, Chen Z, Wei S et al (2017) Attention-over-attention neural networks for reading comprehension, In meeting of the association for computational linguistics","DOI":"10.18653\/v1\/P17-1055"},{"key":"2438_CR26","unstructured":"Devlin J, Chang MW, Lee K, Toutanova K (2019) BERT: pre-training of deep bidirectional transformers for language understanding. In the conference of the North American chapter of the association for computational linguistics: human language technologies, pp. 4171\u20134186"},{"key":"2438_CR27","unstructured":"Radford A, Narasimhan K, Salimans T, Sutskever I (2018) Improving language understanding by generative pre-training. OpenAI Blog"},{"key":"2438_CR28","doi-asserted-by":"crossref","unstructured":"Feng ZY, Guo DY, Tang DY et al (2020) Codebert: a pre-trained model for programming and natural languages, In EMNLP","DOI":"10.18653\/v1\/2020.findings-emnlp.139"},{"key":"2438_CR29","doi-asserted-by":"crossref","unstructured":"Liu Z, Huang DG, Huang KY, Li Z, Zhao J (2020) FinBERT: a pre-trained financial language representation model for financial text mining, in proceedings of the 29th international joint conference on artificial intelligence special track on AI in FinTech","DOI":"10.24963\/ijcai.2020\/622"},{"key":"2438_CR30","doi-asserted-by":"crossref","unstructured":"Beltagy I, Lo K, Cohan A (2019) SCIBERT: a pretrained language model for scientific text, in proceedings of the conference on empirical methods in natural language processing, pp. 3615\u20133620","DOI":"10.18653\/v1\/D19-1371"},{"key":"2438_CR31","doi-asserted-by":"crossref","unstructured":"Lee J, Yoon W, Kim SD, Kim D, Kim S, So CH, Kan J (2020) Data and text mining BioBERT: a pretrained biomedical language representation model for biomedical text mining, Bioinformatics, 1234\u20131240","DOI":"10.1093\/bioinformatics\/btz682"},{"key":"2438_CR32","unstructured":"Shen JT, Yamashita M, Prihar E et al (2021) MathBERT: a pre-trained language model for general NLP tasks in mathematics education, arXiv:2106.07340v4"},{"key":"2438_CR33","unstructured":"Brown TB, Mann B, Ryder N et al (2020) Language models are few-shot learners, arXiv:2005.14165"},{"key":"2438_CR34","doi-asserted-by":"crossref","unstructured":"Xiong Y, Feng Y, Wu H, Kamigaito H, Okumura M (2021) Fusing label embedding into BERT: an efficient improvement for text classification. ACL-IJCNLP, findings of the association for computational linguistics, pp 1743\u20131750","DOI":"10.18653\/v1\/2021.findings-acl.152"},{"key":"2438_CR35","doi-asserted-by":"crossref","unstructured":"Wang R, Tang D, Duan N et al (2021) K-Adapter: infusing knowledge into pre-trained models with adapters. ACL-IJCNLP, findings of the association for computational linguistics, pp 1405\u20131418","DOI":"10.18653\/v1\/2021.findings-acl.121"},{"key":"2438_CR36","unstructured":"Vaswani A, Shazeer N, Parmar N et al (2017) Attention is all you need, In NeurIPS, pp. 5998\u20136008"},{"key":"2438_CR37","unstructured":"Dan H, Burns C, Kadavath S et al (2021) Measuring mathematical problem solving with the MATH dataset. arXiv:2103.03874"},{"key":"2438_CR38","doi-asserted-by":"crossref","unstructured":"Poerner N, Waltinger U, Schutze H (2020) E-BERT: efficient-yet-effective entity embeddings for BERT. EMNLP, in findings of the association for computational linguistics, pp 803\u2013818","DOI":"10.18653\/v1\/2020.findings-emnlp.71"},{"key":"2438_CR39","doi-asserted-by":"crossref","unstructured":"Kassner N, Schutze H (2020) Negated and misprimed probes for pretrained language models: birds can talk, but cannot fly, in proceedings of the 58th annual meeting of the association for computational linguistics, pp. 7811\u20137818","DOI":"10.18653\/v1\/2020.acl-main.698"},{"key":"2438_CR40","unstructured":"Chang H-S, Hsu H-J, Chen K-T (2015) Modeling exercise relationships in e-learning: a unified approach, in proceedings of the 8th international conference on educational data mining, pp. 532\u2013535"},{"key":"2438_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106085","volume":"203","author":"ZY Duan","year":"2020","unstructured":"Duan ZY, Wang LM, Chen SL, Sun MH (2020) Instance-based weighting filter for superparent one-dependence estimators. Knowl-Based Syst 203:106085","journal-title":"Knowl-Based Syst"},{"key":"2438_CR42","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.patcog.2016.08.008","volume":"61","author":"I Pillai","year":"2017","unstructured":"Pillai I, Fumera G, Roli F (2017) Designing multi-label classifiers that maximize F-measures: state of the art. Pattern Recogn 61:394\u2013404","journal-title":"Pattern Recogn"},{"issue":"2","key":"2438_CR43","doi-asserted-by":"publisher","first-page":"385","DOI":"10.3233\/IDA-194509","volume":"24","author":"ZY Duan","year":"2020","unstructured":"Duan ZY, Wang LM, Sun MH (2020) Efficient heuristics for learning Bayesian network from labeled and unlabeled data. Intell Data Anal 24(2):385\u2013408","journal-title":"Intell Data Anal"},{"key":"2438_CR44","unstructured":"Liu YH, Ott M, Goyal N et al (2019) RoBERTa: a robustly optimized BERT pretraining approach, arXiv:1907.11692v1"},{"key":"2438_CR45","unstructured":"Touvron H, Lavril T, Lavril, Izacard G et al (2023) Llama: open and efficient foundation language models, arXiv:2302.13971"},{"key":"2438_CR46","unstructured":"OpenAI (2023) GPT-4 technical report"},{"key":"2438_CR47","unstructured":"Anthropic (2024) The Claude 3 Model Family: Opus, Sonnet, Haiku,"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02438-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02438-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02438-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T12:40:53Z","timestamp":1757162453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02438-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,3]]},"references-count":47,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2438"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02438-x","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2025,5,3]]},"assertion":[{"value":"20 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}