TF-IDF untuk alur film

Mari gunakan alur dari film yang dipilih secara acak untuk melakukan klasterisasi dokumen. Sebelum melakukan klasterisasi pada dokumen, dokumen perlu dibersihkan dari noise yang tidak diinginkan (seperti karakter khusus dan stop word) dan diubah menjadi matriks jarang melalui TF-IDF dokumen.

Gunakan kelas TfidfVectorizer untuk melakukan TF-IDF pada alur film yang disimpan dalam daftar plots. Fungsi remove_noise() tersedia untuk digunakan sebagai tokenizer di kelas TfidfVectorizer. Metode .fit_transform() memasangkan data ke dalam objek TfidfVectorizer lalu menghasilkan matriks jarang TF-IDF.

Catatan: Menjalankan metode .fit_transform() memerlukan beberapa detik.

Latihan ini merupakan bagian dari kursus

Analisis Klaster di Python

Instruksi latihan

Impor kelas TfidfVectorizer dari sklearn.
Inisialisasi kelas TfidfVectorizer dengan frekuensi minimum dan maksimum masing-masing 0,1 dan 0,75, serta 50 fitur maksimum.
Gunakan metode fit_transform() pada kelas TfidfVectorizer yang telah diinisialisikan dengan daftar plots.

Latihan interaktif langsung praktik

Cobalah latihan ini dengan melengkapi kode contoh ini.

# Import TfidfVectorizer class from sklearn
from sklearn.feature_extraction.text import ____

# Initialize TfidfVectorizer
tfidf_vectorizer = TfidfVectorizer(____)

# Use the .fit_transform() method on the list plots
tfidf_matrix = ____

Edit dan Jalankan Kode

Latihan ini merupakan bagian dari kursus

Analisis Klaster di Python

SkillTag.level.intermediateSkillTag.label

4.8+

Mulai Kursus 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: Warna dominan pada gambar Exercise 2: Ekstrak nilai RGB dari gambar Exercise 3: Berapa banyak warna dominan?Exercise 4: Tampilkan warna dominan Exercise 5: Pengelompokan dokumen Exercise 6: TF-IDF untuk alur film

Latihan Saat Ini

Exercise 7: Term teratas dalam cluster film Exercise 8: Clustering dengan banyak fitur Exercise 9: Clustering dengan banyak fitur Exercise 10: Pemeriksaan dasar pada klaster Exercise 11: FIFA 18: apa yang membuat pemain komplet?Exercise 12: Sampai jumpa!