Clustering Algorithms (Probability & Mathematical Statistics)
โ Scribed by John A. Hartigan
- Publisher
- Wiley
- Year
- 1975
- Tongue
- English
- Leaves
- 369
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Profiles -- Distances -- Quick partition algorithms -- The K-means algorithm -- Mixtures -- Partition by exact optimization -- The ditto algorithm -- Drawing trees -- Quick tree calculation -- Triads -- Single-linkage trees -- Distance and amalgamation algorithms -- Minimum mutation methods -- Direct splitting -- Direct joining -- Simultaneous clustering and scaling -- Factor analysis -- Prediction
๐ SIMILAR VOLUMES
Cluster analysis is an unsupervised process that divides a set of objects into homogeneous groups. This book starts with basic information on cluster analysis, including the classification of data and the corresponding similarity measures, followed by the presentation of over 50 clustering algorithm
Cluster analysis is an unsupervised process that divides a set of objects into homogeneous groups. This book starts with basic information on cluster analysis, including the classification of data and the corresponding similarity measures, followed by the presentation of over 50 clustering algorithm
Cluster analysis is an unsupervised process that divides a set of objects into homogeneous groups. This book starts with basic information on cluster analysis, including the classification of data and the corresponding similarity measures, followed by the presentation of over 50 clustering algorithm
This is the most complete reliability book that I have seen. It is appropriate as both a textbook and a reference. It is well-written and easy to understand. I highly recommend this book for anybody interested in learning reliability theory.