Modern Algorithms of Cluster Analysis
-
- Hardcover ausgewählt
- Taschenbuch
- eBook
-
Sprache:Englisch
Fr. 219.00
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Gebundene Ausgabe
Erscheinungsdatum
29.01.2018
Abbildungen
XX, 51 illus., schwarz-weiss Illustrationen
Verlag
SpringerSeitenzahl
421
Maße (L/B/H)
24.1/16/3 cm
Gewicht
828 g
Auflage
1st edition 2018
Sprache
Englisch
ISBN
978-3-319-69307-1
This book provides the reader with a basic understanding of the formal concepts of the cluster, clustering, partition, cluster analysis etc.
The book explains feature-based, graph-based and spectral clustering methods and discusses their formal similarities and differences. Understanding the related formal concepts is particularly vital in the epoch of Big Data; due to the volume and characteristics of the data, it is no longer feasible to predominantly rely on merely viewing the data when facing a clustering problem.
Usually clustering involves choosing similar objects and grouping them together. To facilitate the choice of similarity measures for complex and big data, various measures of object similarity, based on quantitative (like numerical measurement results) and qualitative features (like text), as well as combinations of the two, are described, as well as graph-based similarity measures for (hyper) linked objects and measures for multilayered graphs. Numerous variants demonstrating how such similarity measures can be exploited when defining clustering cost functions are also presented.
In addition, the book provides an overview of approaches to handling large collections of objects in a reasonable time. In particular, it addresses grid-based methods, sampling methods, parallelization via Map-Reduce, usage of tree-structures, random projections and various heuristic approaches, especially those used for community detection.
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.