liveBook · Manning

Unsupervised learning

As explained in Advanced Algorithms and Data Structures

Unsupervised learning is machine learning that analyzes unlabeled data to discover structure or patterns without predefined categories.

Unsupervised learning analyzes unlabeled data without feedback, seeking hidden structure rather than applying predefined categories. Its central task is grouping similar points while separating dissimilar ones. section 12.1.1

Clustering turns the general objective into practical data-analysis tasks:

  • Segment customers by purchasing behavior, then inspect the resulting groups to interpret their composition. section 12.1.1
  • Find unusual data, such as signal noise or other points that stand apart from the main structure. section 12.1.1 section 12.6
  • Preprocess large datasets by breaking them into coherent groups before applying more sophisticated algorithms. section 11.4.4

Customer grouping

Given people described by age, education, financial situation, and similar attributes, clustering can produce meaningful groups. Analysts must interpret those groups; the algorithm does not name them or explain what they represent. section 11.4.4

The choice of clustering method determines which structures are visible. K-means is simple but limited to convex clusters; DBSCAN handles arbitrary shapes but struggles with heterogeneous density; OPTICS supports varying density through hierarchical clustering. section 12.6

How Advanced Algorithms and Data Structures covers it

How deep it goes
Explains the objective through clustering, then compares algorithms, evaluation metrics, and hyper-parameter selection.
Examples
Uses customer segmentation, signal-noise detection, unusual-point discovery, and grouping people by demographic and financial attributes.
What you can do after
Apply it via clustering to group unlabeled points, inspect discovered categories, detect noise, and prepare data for later algorithms.
How it connects
Connects unsupervised learning with supervised learning, reinforcement learning, clustering, k-means, DBSCAN, OPTICS, and nearest neighbor search.

Also explained in

Compare how 20 books explain unsupervised learning →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Advanced Algorithms and Data Structures. The section links point to the parts of the book it draws on.