Description

Book Synopsis
In the age of data-driven problem-solving, applying sophisticated computational tools for explaining substantive phenomena is a valuable skill. Yet, application of methods assumes an understanding of the data, structure, and patterns that influence the broader research program. This Element offers researchers and teachers an introduction to clustering, which is a prominent class of unsupervised machine learning for exploring and understanding latent, non-random structure in data. A suite of widely used clustering techniques is covered in this Element, in addition to R code and real data to facilitate interaction with the concepts. Upon setting the stage for clustering, the following algorithms are detailed: agglomerative hierarchical clustering, k-means clustering, Gaussian mixture models, and at a higher-level, fuzzy C-means clustering, DBSCAN, and partitioning around medoids (k-medoids) clustering.

Table of Contents
1. Introduction; 2. Setting the stage for clustering; 3. Agglomerative hierarchical clustering; 4. k-means clustering; 5. Gaussian mixture models; 6. Advanced methods; 7. Conclusion.

Unsupervised Machine Learning for Clustering in

Product form

£16.15

Includes FREE delivery

RRP £17.00 – you save £0.85 (5%)

Order before 4pm today for delivery by Wed 7 Jan 2026.

A Paperback by Philip D. Waggoner

1 in stock


    View other formats and editions of Unsupervised Machine Learning for Clustering in by Philip D. Waggoner

    Publisher: Cambridge University Press
    Publication Date: 1/28/2021 12:00:00 AM
    ISBN13: 9781108793384, 978-1108793384
    ISBN10: 110879338X

    Description

    Book Synopsis
    In the age of data-driven problem-solving, applying sophisticated computational tools for explaining substantive phenomena is a valuable skill. Yet, application of methods assumes an understanding of the data, structure, and patterns that influence the broader research program. This Element offers researchers and teachers an introduction to clustering, which is a prominent class of unsupervised machine learning for exploring and understanding latent, non-random structure in data. A suite of widely used clustering techniques is covered in this Element, in addition to R code and real data to facilitate interaction with the concepts. Upon setting the stage for clustering, the following algorithms are detailed: agglomerative hierarchical clustering, k-means clustering, Gaussian mixture models, and at a higher-level, fuzzy C-means clustering, DBSCAN, and partitioning around medoids (k-medoids) clustering.

    Table of Contents
    1. Introduction; 2. Setting the stage for clustering; 3. Agglomerative hierarchical clustering; 4. k-means clustering; 5. Gaussian mixture models; 6. Advanced methods; 7. Conclusion.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account