โ† All Machine Learning Flashcard Decks

Unsupervised Learning Flashcards

7 cards from real Machine Learning practice questions. Tap to flip, then mark Knew It or Still Learning โ€” missed cards come back until you master them.

Read the first 7 Unsupervised Learning flashcards as text
  1. What is an autoencoder in the context of unsupervised learning?

    Answer: A neural network trained to reconstruct its input through a bottleneck

    An autoencoder compresses input to a lower-dimensional latent code (encoder) and then reconstructs the original input (decoder).

  2. Which linkage criterion in hierarchical clustering tends to produce compact, spherical clusters?

    Answer: Ward linkage

    Ward linkage minimizes the total within-cluster variance at each merge step, producing compact and roughly spherical clusters.

  3. What problem does ICA (Independent Component Analysis) solve that PCA does not?

    Answer: Separating statistically independent non-Gaussian source signals

    ICA finds a decomposition into statistically independent components, making it suitable for blind source separation tasks like separating audio signals.

  4. What is a dendrogram used for in clustering?

    Answer: Visualizing the hierarchy of cluster merges in agglomerative clustering

    A dendrogram is a tree diagram showing the sequence of merges in hierarchical clustering, helping choose the number of clusters by cutting at a desired height.

  5. Which assumption does K-Means make about cluster shapes?

    Answer: Clusters are convex and isotropic (spherical)

    K-Means uses Euclidean distance to assign points to the nearest centroid, implicitly assuming clusters are convex and roughly spherical.

  6. In topic modeling with Latent Dirichlet Allocation (LDA), what are documents modeled as?

    Answer: Mixtures of topics, where each topic is a distribution over words

    LDA models each document as a mixture of latent topics, and each topic as a probability distribution over vocabulary words.

  7. What does 'inertia' measure in K-Means clustering?

    Answer: The sum of squared distances from each point to its assigned cluster centroid

    Inertia (also called within-cluster sum of squares, WCSS) measures how tightly packed the clusters are; lower inertia means more compact clusters.

How this page was made: written with AI tools and published by Nathan Beja, founder of Practice Test Geeks, who is responsible for its content. We have not yet matched this exam's facts to an official source, so confirm fees, dates and rules with the exam body. Not reviewed by a subject-matter expert. Editorial policy