Advertisement

Ranking the Teams in European Football Leagues with Agony

  • Stefan NeumannEmail author
  • Julian Ritter
  • Kailash Budhathoki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11330)

Abstract

Ranking football (soccer) teams is usually done using league tables as provided by the organizers of the league. These league tables are designed to yield a total ordering of the teams in order to assign unique ranks to the teams. Hence, the number of levels in the league table equals the number of teams. However, in sports analytics one would be interested in categorizing the teams into a small number of substantially different levels of playing quality. In this paper, our goal is to solve this issue for European football leagues. Our approach is based on a generalized version of agony which was introduced by Gupte et al. (WWW’11). Our experiments yield natural rankings of the teams in four major European football leagues into a small number of interpretable quality levels.

Keywords

Football Leagues Ranking Hierarchy Agony 

Notes

Acknowledgements

Stefan Neumann gratefully acknowledges the financial support from the Doctoral Programme “Vienna Graduate School on Computational Optimization” which is funded by the Austrian Science Fund (FWF, project no. W1260-N35). Kailash Budhathoki is supported by the International Max Planck Research School for Computer Science, Germany.

References

  1. 1.
    Football club elo ratings. http://clubelo.com. Accessed 03 Aug 2018
  2. 2.
    World football elo ratings. https://www.eloratings.net. Accessed 03 Aug 2018
  3. 3.
    Constantinou, A.C.: Dolores: a model that predicts football match outcomes from all over the world. Mach. Learn. 108(1), 49–75 (2019).  https://doi.org/10.1007/s10994-018-5703-7MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Constantinou, A.C., Fenton, N.E.: Determining the level of ability of football teams by dynamic ratings based on the relative discrepancies in scores between adversaries. J. Quant. Anal. Sports 9(1), 37–50 (2013)CrossRefGoogle Scholar
  5. 5.
    Elo, A.E.: The Rating of Chess Players, Past and Present. Arco Pub., New York (1978)Google Scholar
  6. 6.
    Even, G., Naor, J.S., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multi-cuts in directed graphs. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol. 920, pp. 14–28. Springer, Heidelberg (1995).  https://doi.org/10.1007/3-540-59408-6_38CrossRefGoogle Scholar
  7. 7.
    Gupte, M., Shankar, P., Li, J., Muthukrishnan, S., Iftode, L.: Finding hierarchy in directed online social networks. In: WWW, pp. 557–566 (2011)Google Scholar
  8. 8.
    Hanauer, K.: Linear orderings of sparse graphs. Ph.D. thesis, University of Passau (2018)Google Scholar
  9. 9.
    Hanauer, K.: Linear orderings of sparse graphs supplementary (2018). https://sparselo.algo-rhythmics.org
  10. 10.
    Hubáček, O., Šourek, G., Železný, F.: Learning to predict soccer results from relational data with gradient boosted trees. Mach. Learn. 108(1), 29–47 (2018).  https://doi.org/10.1007/s10994-018-5704-6MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Hvattum, L.M., Arntzen, H.: Using ELO ratings for match result prediction in association football. Int. J. Forecast. 26(3), 460–470 (2010)CrossRefGoogle Scholar
  12. 12.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85–103. Springer, Boston (1972).  https://doi.org/10.1007/978-1-4684-2001-2_9CrossRefGoogle Scholar
  13. 13.
    Leitner, C., Zeileis, A., Hornik, K.: Forecasting sports tournaments by ratings of (prob)abilities: a comparison for the EURO 2008. Int. J Forecast. 26(3), 471–481 (2010)CrossRefGoogle Scholar
  14. 14.
    Skinner, G.K., Freeman, G.H.: Soccer matches as experiments: how often does the ‘best’ team win? J. Appl. Stat. 36(10), 1087–1095 (2009).  https://doi.org/10.1080/02664760802715922MathSciNetCrossRefGoogle Scholar
  15. 15.
    Tatti, N.: Faster way to agony: discovering hierarchies in directed graphs. In: Calders, T., Esposito, F., Hüllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8726, pp. 163–178. Springer, Heidelberg (2014).  https://doi.org/10.1007/978-3-662-44845-8_11CrossRefGoogle Scholar
  16. 16.
    Tatti, N.: Hierarchies in directed networks. In: ICDM, pp. 991–996 (2015)Google Scholar
  17. 17.
    Tatti, N.: Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks. Data Min. Knowl. Discov. 31(3), 702–738 (2017)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Stefan Neumann
    • 1
    Email author
  • Julian Ritter
    • 2
  • Kailash Budhathoki
    • 3
  1. 1.Faculty of Computer ScienceUniversity of ViennaViennaAustria
  2. 2.Laboratoire d’informatiqueÉcole polytechniquePalaiseauFrance
  3. 3.Max Planck Institute for Informatics and Saarland UniversitySaarbrückenGermany

Personalised recommendations