Visualizza i colori dominanti

Abbiamo caricato la seguente immagine usando la funzione imread() della classe image di matplotlib.

Per visualizzare i colori dominanti, converti i colori dei centroidi dei cluster nei loro valori grezzi e poi riportali nell’intervallo 0-1 usando la seguente formula: converted_pixel = standardized_pixel * pixel_std / 255

I valori RGB sono memorizzati in un DataFrame, batman_df. I valori RGB scalati sono salvati nelle colonne scaled_red, scaled_blue e scaled_green. I centroidi dei cluster sono memorizzati nella variabile cluster_centers, generati usando la funzione kmeans() con tre cluster.

Questo esercizio fa parte del corso

Analisi di cluster in Python

Visualizza il corso

Istruzioni dell'esercizio

Ricava le deviazioni standard di ciascun colore dal DataFrame e salvale in r_std, g_std, b_std.
Per ciascun centroide, converti i valori RGB standardizzati in valori scalati nell’intervallo 0-1.
Visualizza i colori dei centroidi dei cluster.

Esercizio pratico interattivo

Prova a risolvere questo esercizio completando il codice di esempio.

# Get standard deviations of each color
____, ____, ____ = batman_df[['red', 'green', 'blue']].___()

for cluster_center in cluster_centers:
    scaled_r, scaled_g, scaled_b = cluster_center
    # Convert each standardized value to scaled value
    colors.append((
        scaled_r * ____ / ____,
        scaled_g * ____ / ____,
        scaled_b * ____ / ____
    ))

# Display colors of cluster centers
plt.____(____)
plt.show()

Modifica ed esegui il codice

Questo esercizio fa parte del corso

Analisi di cluster in Python

IntermediárioNível de habilidade

4.8+

Inizia il corso 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: Colori dominanti nelle immagini Exercise 2: Estrai i valori RGB dall'immagine Exercise 3: Quanti colori dominanti?Exercise 4: Visualizza i colori dominanti

Esercizio in corso

Exercise 5: Clustering di documenti Exercise 6: TF-IDF delle trame dei film Exercise 7: Termini principali nei cluster di film Exercise 8: Clustering con più caratteristiche Exercise 9: Clustering con molte feature Exercise 10: Verifiche di base sui cluster Exercise 11: FIFA 18: cosa rende un giocatore completo?Exercise 12: Arrivederci!