21,989 research outputs found

    Influences on the Formation of Coach-Athlete Relationships

    Get PDF
    For a team to be successful, coaches and players need to have a good relationship. Without this relationship there can be tension within the team that hinders success. The many factors that impact the formation of these relationships depend on both the coach and the athlete. From the data it shows that the athletes that were part of the sample, their motivation and other factors were affected by the poor relationships that were built. If there can be information on what affects the relationship, future coaches and athletic directors can use this information to their advantage

    Generalized density clustering

    Full text link
    We study generalized density-based clustering in which sharply defined clusters such as clusters on lower-dimensional manifolds are allowed. We show that accurate clustering is possible even in high dimensions. We propose two data-based methods for choosing the bandwidth and we study the stability properties of density clusters. We show that a simple graph-based algorithm successfully approximates the high density clusters.Comment: Published in at http://dx.doi.org/10.1214/10-AOS797 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Consistency of spectral clustering in stochastic block models

    Full text link
    We analyze the performance of spectral clustering for community extraction in stochastic block models. We show that, under mild conditions, spectral clustering applied to the adjacency matrix of the network can consistently recover hidden communities even when the order of the maximum expected degree is as small as logn\log n, with nn the number of nodes. This result applies to some popular polynomial time spectral clustering algorithms and is further extended to degree corrected stochastic block models using a spherical kk-median spectral clustering method. A key component of our analysis is a combinatorial bound on the spectrum of binary random matrices, which is sharper than the conventional matrix Bernstein inequality and may be of independent interest.Comment: Published in at http://dx.doi.org/10.1214/14-AOS1274 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org
    corecore