Past colloquia and seminars


Ranking with randomness (Analysis on sports data)

Academic or specialist Other

Ranking is not only everywhere in our daily life but also one of the most basic and essential topics in scientific research. People keep pursuing perfect ranking, which is extremely important for many fields such as business, military, medical, science, and so on. However, the uncertainty of the natural world is the biggest barrier to our progress towards this goal. Therefore, in recent years, studying the stability of algorithms has become a hot scientific topic. A stable algorithm means that it can maintain the original ranking accuracy when facing various uncertain environments. Ranking in sports is an important topic that attracts much attention. Moreover, it is the most natural choice for our study due to the inherent uncertainty and complexity of sports data. In this thesis, we study the influence of randomness on the performance of different ranking algorithms in detail with the background of the sports results network. We demonstrate here, for the first time, that this sensitivity combined with the natural randomness of sport greatly limits fully-global algorithms’ performance on results from a sports tournament. Compared with our ordinary cognition that improving information utilization is the key to better performance, our results show that appropriately reducing the utilization can enhance ranking robustness and expand the application scope of algorithms. We also prove that our robustness enhancement method can be combined with other anti-bias methods to obtain a fairer and more perfect algorithm. Besides providing specific results of ranking on sports results data, our work also highlights the need to carefully assess the actual performance and limitations of network metrics before using them. This need is exacerbated by the complexity and uncertainty of systems that produce the data, which makes it difficult to judge ex-ante if an algorithm is a good match for the data. Our models and research methods also provide a powerful tool for testing the performance of other ranking algorithms and finding the optimal algorithm in the different applications.

When? 15.05.2023 16:00
Where? PER 08 0.51
Chemin du Musée 3
1700 Fribourg
speaker Yuhao Zhou, Présentation publique de thèse de doctorat
Groupe Zhang
Contact Département de physique, groupe Zhang
Prof. Zhang