{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T23:18:29Z","timestamp":1761175109407,"version":"build-2065373602"},"reference-count":23,"publisher":"Polish Information Processing Society","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2025f3675","type":"proceedings-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:44:23Z","timestamp":1761119063000},"page":"825-830","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Boosting and Multi-Modal Fusion for Chess Puzzle Difficulty Prediction"],"prefix":"10.15439","volume":"43","author":[{"given":"Ming","family":"Liu","sequence":"first","affiliation":[{"name":"JintaiStratech"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junye","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinghan","family":"Hu","sequence":"additional","affiliation":[{"name":"Jilin University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolin","family":"Yang","sequence":"additional","affiliation":[{"name":"Inspur China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Defu","family":"Lin","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6175","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"ref1","unstructured":"Deep-Blue: https:\/\/www.ibm.com\/history\/deep-blue."},{"key":"ref2","unstructured":"G. Ke et al., \u201cLightGBM: A Highly Efficient Gradient Boosting Decision\nTree,\u201d in Advances in Neural Information Processing Systems (NeurIPS),\n2017, pp. 3146\u20133154."},{"key":"ref3","doi-asserted-by":"crossref","unstructured":"T. Chen and C. Guestrin, \u201cXGBoost: A Scalable Tree Boosting System,\u201d in Proc. ACM SIGKDD International Conference on Knowledge\nDiscovery and Data Mining, 2016, pp. 785\u2013794.","DOI":"10.1145\/2939672.2939785"},{"key":"ref4","unstructured":"B. Oshri and N. Khandwala, \u201cPredicting Moves in Chess Using Convolutional Neural Networks (ConvChess),\u201d Stanford University CS231n\nProject Report, 2015. [Online]. Available: https:\/\/cs231n.stanford.edu\/reports\/2015\/pdfs\/ConvChess.pdf"},{"key":"ref5","unstructured":"K. Omori and P. Tadepalli, \u201cModeling Player Ratings and Puzzle\nDifficulty Using CNN-LSTM Architectures,\u201d in Proc. AAAI Conference\non Artificial Intelligence, 2021, pp. 5341\u20135348."},{"key":"ref6","doi-asserted-by":"publisher","unstructured":"O. E. David, N. S. Netanyahu, and L. Wolf, \u201cDeepChess: End-to-End\nDeep Neural Network for Automatic Learning in Chess,\u201d in Artificial\nNeural Networks and Machine Learning \u2013 ICANN 2016, Springer International Publishing, 2016, pp. 88\u201396. https:\/\/dx.doi.org\/10.1007\/978-3-319-44781-0_11.","DOI":"10.1007\/978-3-319-44781-0_11"},{"key":"ref7","doi-asserted-by":"publisher","unstructured":"J. Zy\u015bko, M. \u015awiechowski, S. Stawicki, K. Jagie\u0142a, A. Janusz and D.\n\u015al\u02db ezak, \"IEEE Big Data Cup 2024 Report: Predicting Chess Puzzle\nDifficulty at KnowledgePit.ai,\" 2024 IEEE International Conference on\nBig Data (BigData), Washington, DC, USA, 2024, pp. 8423-8429, https:\/\/dx.doi.org\/10.1109\/BigData62323.2024.10825289.","DOI":"10.1109\/BigData62323.2024.10825289"},{"key":"ref8","unstructured":"S. Doe, J. Smith, and K. Brown, \u201cGlickFormer: A Spatio-Temporal\nTransformer for Predicting Chess Puzzle Difficulty,\u201d in Proc. IEEE\nInternational Conference on Big Data, 2024, pp. 1234\u20131243."},{"key":"ref9","doi-asserted-by":"publisher","unstructured":"T. Woodruff, O. Filatov, and M. Cognetta, \u201cThe bread emoji team\u2019s submission to the IEEE BigData 2024 Cup: Predicting chess puzzle difficulty challenge,\u201d in 2024 IEEE International Conference on Big Data (BigData), 2024, pp. 8415\u20138422, https:\/\/dx.doi.org\/10.1109\/BigData62323.2024.10826037.","DOI":"10.1109\/BigData62323.2024.10826037"},{"key":"ref10","doi-asserted-by":"publisher","unstructured":"D. Ruta, M. Liu and L. Cen, \"Moves Based Prediction of Chess\nPuzzle Difficulty with Convolutional Neural Networks,\" 2024 IEEE\nInternational Conference on Big Data (BigData), Washington, DC, USA,\n2024, pp. 8390-8395, https:\/\/dx.doi.org\/10.1109\/BigData62323.2024.10825595.","DOI":"10.1109\/BigData62323.2024.10825595"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"M. Liu, L. Cen and D. Ruta. Exploring Stability and Performance\nof hybrid Gradient Boosting Classification and Regression Models in\nSectors Stock Trend Prediction: A Tale of Preliminary Success and Final\nChallenge. 19th Conf. Comp. Sci. and Intel. Sys. (FedCSIS), Serbia,\n2024.","DOI":"10.15439\/2024F2428"},{"key":"ref12","doi-asserted-by":"publisher","unstructured":"M. Liu, L. Cen and D. Ruta, \"Gradient Boosting Models for Cybersecurity Threat Detection with Aggregated Time Series Features,\" 2023 18th\nConference on Computer Science and Intelligence Systems (FedCSIS),\nWarsaw, Poland, 2023, pp. 1311-1315, https:\/\/dx.doi.org\/10.15439\/2023F4457.","DOI":"10.15439\/2023F4457"},{"key":"ref13","doi-asserted-by":"publisher","unstructured":"D. Ruta, M. Liu and L. Cen, \"Beating Gradient Boosting: Target-Guided\nBinning for Massively Scalable Classification in Real-Time,\" 2023 18th\nConference on Computer Science and Intelligence Systems (FedCSIS),\nWarsaw, Poland, 2023, pp. 1301-1306, https:\/\/dx.doi.org\/10.15439\/2023F7166.","DOI":"10.15439\/2023F7166"},{"key":"ref14","doi-asserted-by":"crossref","unstructured":"D. Ruta, M. Liu, L. Cen. Feature Engineering for Predicting Frags in\nTactical Games. Proc. Int. Conf. 2023 IEEE International Conference\non Multimedia and Expo, 2023.","DOI":"10.1109\/ICMEW59549.2023.00011"},{"key":"ref15","doi-asserted-by":"crossref","unstructured":"D. Ruta, M. Liu, L. Cen and Q. Hieu Vu. Diversified gradient boosting\nensembles for prediction of the cost of forwarding contracts. Proc. Int.\n17th Conf. on Computer Science and Intelligence Systems, 2022.","DOI":"10.15439\/2022F291"},{"key":"ref16","unstructured":"Q. Hieu Vu, L. Cen, D. Ruta and M. Liu. Key Factors to Consider when\nPredicting the Costs of Forwarding Contracts. Proc. Int. Conf. 2022 17th\nConf. on Computer Science and Intelligence Systems, 2022."},{"key":"ref17","doi-asserted-by":"crossref","unstructured":"D. Ruta, L. Cen, M. Liu and Q. Hieu Vu. Automated feature engineering\nfor prediction of victories in online computer games. Proc. Int. Conf on\nBig Data, 2021.","DOI":"10.1109\/BigData52589.2021.9671345"},{"key":"ref18","unstructured":"Q. Hieu Vu, D. Ruta, L. Cen and M. Liu. A combination of general and\nspecific models to predict victories in video games. Proc. Int. Conf. on\nBig Data, 2021."},{"key":"ref19","doi-asserted-by":"crossref","unstructured":"D. Ruta, L. Cen and Q. Hieu Vu. Deep Bi-Directional LSTM Networks\nfor Device Workload Forecasting. Proc. 15th Int. Conf. Comp. Science\nand Inf. Sys., 2020.","DOI":"10.15439\/2020F213"},{"key":"ref20","doi-asserted-by":"crossref","unstructured":"L. Cen, D. Ruta and Q. Hieu Vu. Efficient Support Vector Regression\nwith Reduced Training Data. Proc. Fed. Conf. on Comp. Science and\nInf. Sys., 2019.","DOI":"10.15439\/2019F362"},{"key":"ref21","doi-asserted-by":"publisher","unstructured":"J. Zy\u015bko, M. \u015al\u0229zak, D. \u015al\u0229zak, and M. \u015awiechowski, \u201cFedCSIS 2025\nknowledgepit.ai Competition: Predicting Chess Puzzle Difficulty Part 2\n& A Step Toward Uncertainty Contests,\u201d in Proc. 20th Conf. Comput.\nSci. Intell. Syst. (FedCSIS), vol. 43, Polish Inf. Process. Soc., 2025. http:\/\/dx.doi.org\/10.15439\/2025F5937.","DOI":"10.15439\/2025F5937"},{"key":"ref22","unstructured":"L. Prokhorenkova, G. Gusev, A. Vorobev, A. Dorogush, and A.\nGulin, \u201cCatBoost: Unbiased Boosting with Categorical Features,\u201d in\nAdvances in Neural Information Processing Systems (NeurIPS), 2018,\npp. 6638\u20136648."},{"key":"ref23","unstructured":"M. Tan and Q. Le, \u201cEfficientNet: Rethinking Model Scaling for Convolutional Neural Networks,\u201d in Proc. International Conference on Machine\nLearning (ICML), 2019, pp. 6105\u20136114."}],"event":{"name":"20th Conference on Computer Science and Intelligence Systems (FedCSIS)","theme":"Computer Science and Intelligence Systems","location":"Krak\u00f3w, Poland","acronym":"FedCSIS","number":"20","start":{"date-parts":[[2025,9,14]]},"end":{"date-parts":[[2025,9,17]]}},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 20th Conference on Computer Science and Intelligence Systems (FedCSIS)"],"original-title":[],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:52:10Z","timestamp":1761119530000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_43\/drp\/3675.html"}},"subtitle":[],"proceedings-subject":"Computer Science and Information Systems","short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":23,"URL":"https:\/\/doi.org\/10.15439\/2025f3675","relation":{},"ISSN":["2300-5963"],"issn-type":[{"value":"2300-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10,15]]}}}