Complex networks for community detection of basketball players

14Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper a weighted complex network is used to detect communities of basketball players on the basis of their performances. A sparsification procedure to remove weak edges is also applied. In our proposal, at each removal of an edge the best community structure of the “giant component” is calculated, maximizing the modularity as a measure of compactness within communities and separation among communities. The “sparsification transition” is confirmed by the normalized mutual information. In this way, not only the best distribution of nodes into communities is found, but also the ideal number of communities as well. An application to community detection of basketball players for the NBA regular season 2020–2021 is presented. The proposed methodology allows a data driven decision making process in basketball.

Cite

CITATION STYLE

APA

Chessa, A., D’Urso, P., De Giovanni, L., Vitale, V., & Gebbia, A. (2023). Complex networks for community detection of basketball players. Annals of Operations Research, 325(1), 363–389. https://doi.org/10.1007/s10479-022-04647-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free