Search

In this paper we propose a dashboard of indicators of territorial attractiveness at NUTS3 level in the framework of the EU Regional Competitiveness Index (RCI). Then, the Fuzzy C-Medoids Clustering model with multivariate data and contiguity constraints is applied for partitioning the Italian provinces (NUTS3). The novelty is the territorial level analized, and the identification of the elementary indicators at the basis of the construction of the eleven composite competitiveness pillars. The positioning of the Italian provinces is deeply analyzed. The clusters obtained with and without contraints are compared. The obtained partition may play an important role in the design of policies at the NUTS3 level, a route already considered by the Italian government. The analysis developed and the related set of indicators at NUTS3 level constitute an information base that could be effectively used for the implementation of the National Recovery and Resilience Plan (NRRP). [ABSTRACT FROM AUTHOR]

Statistics in sports plays a key role in predicting winning strategies and providing objective performance indicators. Despite the growing interest in recent years in using statistical methodologies in this field, less emphasis has been given to the multivariate approach. This work aims at using the Bayesian networks to model the joint distribution of a set of indicators of players' performances in basketball in order to discover the set of their probabilistic relationships as well as the main determinants affecting the player's winning percentage. From a methodological point of view, the interest is to define a suitable model for non-Gaussian data, relaxing the strong assumption on normal distribution in favour of Gaussian copula. Through the estimated Bayesian network, we discovered many interesting dependence relationships, providing a scientific validation of some known results mainly based on experience. At last, some scenarios of interest have been simulated to understand the main determinants that contribute to rising in the number of won games by a player. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

A robust fuzzy clustering model for mixed data is proposed. For each variable, or attribute, a proper dissimilarity measure is computed and the clustering procedure combines the dissimilarity matrices with weights objectively computed during the optimization process. The weights reflect the relevance of each attribute type in the clustering results. A simulation study and an empirical application to football players data are presented that show the effectiveness of the proposed clustering algorithm in finding clusters that would be hidden unless a multi-attributes approach were used. [ABSTRACT FROM AUTHOR]

We propose two robust fuzzy clustering techniques in the context of preference rankings to group judges into homogeneous clusters even in the case of contamination due to outliers or, more generally, noisy data. The two fuzzy C-Medoids clustering methods, based on the same suitable exponential transformation of the Kemeny distance, belong to two different approaches and differ in the way they introduce the fuzziness in the membership matrix, the one based on the "m" exponent and the other on the Shannon entropy. As far as the Kemeny distance is concerned, it is equivalent to the Kendall distance in the case of complete rankings but differs from the latter in the way of handling tied rankings. Simulations prove that our methods are able to recover the natural structure of the groups neutralizing the effect of possible noises and outliers. Two applications to real datasets are also provided. [ABSTRACT FROM AUTHOR]