IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v40y2025i4d10.1007_s00180-024-01493-2.html
   My bibliography  Save this article

Network and attribute-based clustering of tennis players and tournaments

Author

Listed:
  • Pierpaolo D’Urso

    (Sapienza University)

  • Livia Giovanni

    (Luiss University
    Luiss University)

  • Lorenzo Federico

    (Luiss University
    Luiss University)

  • Vincenzina Vitale

    (Sapienza University)

Abstract

This paper aims at targeting some relevant issues for clustering tennis players and tournaments: (i) it considers players, tournaments and the relation between them; (ii) the relation is taken into account in the fuzzy clustering model based on the Partitioning Around Medoids (PAM) algorithm through spatial constraints; (iii) the attributes of the players and of the tournaments are of different nature, qualitative and quantitative. The proposal is novel for the methodology used, a spatial Fuzzy clustering model for players and for tournaments (based on related attributes), where the spatial penalty term in each clustering model depends on the relation between players and tournaments described in the adjacency matrix. The proposed model is compared with a bipartite players-tournament complex network model (the Degree-Corrected Stochastic Blockmodel) that considers only the relation between players and tournaments, described in the adjacency matrix, to obtain communities on each side of the bipartite network. An application on data taken from the ATP official website with regards to the draws of the tournaments, and from the sport statistics website Wheelo ratings for the performance data of players and tournaments, shows the performances of the proposed clustering model.

Suggested Citation

  • Pierpaolo D’Urso & Livia Giovanni & Lorenzo Federico & Vincenzina Vitale, 2025. "Network and attribute-based clustering of tennis players and tournaments," Computational Statistics, Springer, vol. 40(4), pages 1689-1712, April.
  • Handle: RePEc:spr:compst:v:40:y:2025:i:4:d:10.1007_s00180-024-01493-2
    DOI: 10.1007/s00180-024-01493-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-024-01493-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00180-024-01493-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:compst:v:40:y:2025:i:4:d:10.1007_s00180-024-01493-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.