FIFA 18: ¿qué hace a un jugador completo?

El nivel general de un jugador en FIFA 18 se define por seis características: ritmo (pac), tiro (sho), pase (pas), regate (dri), defensa (def) y físico (phy).

Aquí tienes una carta de ejemplo:

Eden Hazard Player Card

En este ejercicio, usarás las seis características para crear clústeres. Los datos están en un DataFrame de pandas, fifa. features es la lista de estos nombres de columnas y scaled_features es la lista de columnas que contiene sus valores escalados. Ya se han precargado: kmeans, vq de scipy.cluster.vq, matplotlib.pyplot como plt, seaborn como sns.

Antes de empezar el ejercicio, quizá quieras explorar scaled_features para consultar la lista de los seis nombres de columnas escaladas.

Este ejercicio forma parte del curso

Análisis de clústeres en Python

ejercicio interactivo práctico

Prueba este ejercicio completando este código de ejemplo.

# Create centroids with kmeans for 2 clusters
cluster_centers,_ = ____

Editar y ejecutar código

Este ejercicio forma parte del curso

Análisis de clústeres en Python

IntermedioNivel de habilidad

4.8+

Empieza el curso gratis

Before you are ready to classify news articles, you need to be introduced to the basics of clustering. This chapter familiarizes you with a class of machine learning algorithms called unsupervised learning and then introduces you to clustering, one of the popular unsupervised learning algorithms. You will know about two popular clustering techniques - hierarchical clustering and k-means clustering. The chapter concludes with basic pre-processing steps before you start clustering data.

Exercise 1: Unsupervised learning: basics Exercise 2: Unsupervised learning in real world Exercise 3: Pokémon sightings Exercise 4: Basics of cluster analysis Exercise 5: Pokémon sightings: hierarchical clustering Exercise 6: Pokémon sightings: k-means clustering Exercise 7: Data preparation for cluster analysis Exercise 8: Normalize basic list data Exercise 9: Visualize normalized data Exercise 10: Normalization of small numbers Exercise 11: FIFA 18: Normalize data

This chapter focuses on a popular clustering algorithm - hierarchical clustering - and its implementation in SciPy. In addition to the procedure to perform hierarchical clustering, it attempts to help you answer an important question - how many clusters are present in your data? The chapter concludes with a discussion on the limitations of hierarchical clustering and discusses considerations while using hierarchical clustering.

Exercise 1: Basics of hierarchical clustering Exercise 2: Hierarchical clustering: ward method Exercise 3: Hierarchical clustering: single method Exercise 4: Hierarchical clustering: complete method Exercise 5: Visualize clusters Exercise 6: Visualize clusters with matplotlib Exercise 7: Visualize clusters with seaborn Exercise 8: How many clusters?Exercise 9: Create a dendrogram Exercise 10: How many clusters in comic con data?Exercise 11: Limitations of hierarchical clustering Exercise 12: Timing run of hierarchical clustering Exercise 13: FIFA 18: exploring defenders

This chapter introduces a different clustering algorithm - k-means clustering - and its implementation in SciPy. K-means clustering overcomes the biggest drawback of hierarchical clustering that was discussed in the last chapter. As dendrograms are specific to hierarchical clustering, this chapter discusses one method to find the number of clusters before running k-means clustering. The chapter concludes with a discussion on the limitations of k-means clustering and discusses considerations while using this algorithm.

Exercise 1: Basics of k-means clustering Exercise 2: K-means clustering: first exercise Exercise 3: Runtime of k-means clustering Exercise 4: How many clusters?Exercise 5: Elbow method on distinct clusters Exercise 6: Elbow method on uniform data Exercise 7: Limitations of k-means clustering Exercise 8: Impact of seeds on distinct clusters Exercise 9: Uniform clustering patterns Exercise 10: FIFA 18: defenders revisited

Now that you are familiar with two of the most popular clustering techniques, this chapter helps you apply this knowledge to real-world problems. The chapter first discusses the process of finding dominant colors in an image, before moving on to the problem discussed in the introduction - clustering of news articles. The chapter concludes with a discussion on clustering with multiple variables, which makes it difficult to visualize all the data.

Exercise 1: Colores dominantes en imágenes Exercise 2: Extraer valores RGB de una imagen Exercise 3: ¿Cuántos colores dominantes?Exercise 4: Muestra los colores dominantes Exercise 5: Clustering de documentos Exercise 6: TF-IDF de sinopsis de películas Exercise 7: Términos más destacados en clústeres de películas Exercise 8: Clustering con múltiples variables Exercise 9: Clustering con muchas variables Exercise 10: Comprobaciones básicas de los clústeres Exercise 11: FIFA 18: ¿qué hace a un jugador completo?

Ejercicio actual

Exercise 12: ¡Hasta pronto!