Constraint programming and machine learning for interactive soccer analysis

Loading...
Thumbnail Image
Files
lion_2016a.pdf(92.33 KB)
Accepted Version
Date
2016-12-01
Authors
Duque, Robinson
Díaz, Juan Francisco
Arbelaez, Alejandro
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Nature Ltd.
Research Projects
Organizational Units
Journal Issue
Abstract
A soccer competition consists of n teams playing against each other in a league or tournament system, according to a single or double round-robin schedule. These competitions offer an excellent opportunity to model interesting problems related to questions that soccer fans frequently ask about their favourite teams. For instance, at some stage of the competition, fans might be interested in determining whether a given team still has chances of winning the competition (i.e., finishing first in a league or being within the first k teams in a tournament to qualify to the playoff). This problem relates to the elimination problem, which is NP-complete for the actual FIFA pointing rule system (0, 1, 3), zero point to a loss, one point to a tie, and three points to a win. In this paper, we combine constraint programming with machine learning to model a general soccer scenario in a real-time application.
Description
Keywords
Single round robin , Elimination problem , Playoffs , Soccer fans , Combining constraint programming
Citation
Duque, R., Díaz, J. F. and Arbelaez, A. (2016) 'Constraint programming and machine learning for interactive soccer analysis', in Festa, P., Sellmann, M. and Vanschoren, J. (eds.) Learning and Intelligent Optimization. LION 2016, pp 240–246. Lecture Notes in Computer Science, 10079. Springer, Cham. https://doi.org/10.1007/978-3-319-50349-3_18
Copyright
© 2016, Springer International Publishing AG. This version of the paper has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/978-3-319-50349-3_18