Finding Groups in Data

An Introduction to Cluster Analysis
1. Auflage 2005
ISBN: 978-0-471-73578-6
Verlag: Wiley

Buch, Englisch, 368 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 559 g

Reihe: Wiley Series in Probability and Statistics

The Wiley-Interscience Paperback Series consists of selected books that have been made more accessible to consumers in an effort to increase global appeal and general circulation. With these new unabridged softcover volumes, Wiley hopes to extend the lives of these works by making them available to future generations of statisticians, mathematicians, and scientists.

"Cluster analysis is the increasingly important and practical subject of finding groupings in data. The authors set out to write a book for the user who does not necessarily have an extensive background in mathematics. They succeed very well."
—Mathematical Reviews

"Finding Groups in Data [is] a clear, readable, and interesting presentation of a small number of clustering methods. In addition, the book introduced some interesting innovations of applied value to clustering literature."
—Journal of Classification

"This is a very good, easy-to-read, and practical book. It has many nice features and is highly recommended for students and practitioners in various fields of study."
—Technometrics

An introduction to the practical application of cluster analysis, this text presents a selection of methods that together can deal with most applications. These methods are chosen for their robustness, consistency, and general applicability. This book discusses various types of data, including interval-scaled and binary variables as well as similarity data, and explains how these can be transformed prior to clustering.

Autoren/Hrsg.

Kaufman, Leonard

Rousseeuw, Peter J

Fachgebiete

• Mathematik | Informatik Mathematik Stochastik Mathematische Statistik
• Mathematik | Informatik Mathematik Algebra Algebraische Strukturen, Gruppentheorie
• Mathematik | Informatik Mathematik Stochastik Wahrscheinlichkeitsrechnung

Inhaltsverzeichnis

1. Introduction.

2. Partitioning Around Medoids (Program PAM).

3. Clustering large Applications (Program CLARA).

4. Fuzzy Analysis.

5. Agglomerative Nesting (Program AGNES).

6. Divisive Analysis (Program DIANA).

7. Monothetic Analysis (Program MONA).

Appendix 1. Implementation and Structure of the Programs.

Appendix 2. Running the Programs.

Appendix 3. Adapting the Programs to Your Needs.

Appendix 4. The Program CLUSPLOT.

References.

Author Index.

Subject Index.

Über Autor(innen)

LEONARD KAUFMAN, PhD, is affiliated with Vrije University in Brussels, Belgium.

PETER J. ROUSSEEUW, PhD, is a Professor in the Department of Mathematics and Computer Science at the University of Antwerp in Belgium.