Modern Algorithms of Cluster Analysis: Studies in Big Data, cartea 34
Autor Slawomir Wierzchoń, Mieczyslaw Kłopoteken Limba Engleză Hardback – 29 ian 2018
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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 1141.41 lei 6-8 săpt. | |
Springer International Publishing – 4 iun 2019 | 1141.41 lei 6-8 săpt. | |
Hardback (1) | 1147.71 lei 6-8 săpt. | |
Springer International Publishing – 29 ian 2018 | 1147.71 lei 6-8 săpt. |
Din seria Studies in Big Data
- 20% Preț: 861.36 lei
- 20% Preț: 997.75 lei
- 20% Preț: 586.43 lei
- 18% Preț: 973.77 lei
- 20% Preț: 1142.04 lei
- 20% Preț: 960.99 lei
- 20% Preț: 1411.17 lei
- 20% Preț: 1136.37 lei
- 20% Preț: 1441.06 lei
- 20% Preț: 1154.98 lei
- 20% Preț: 1146.88 lei
- 20% Preț: 1134.78 lei
- 20% Preț: 978.77 lei
- 20% Preț: 907.68 lei
- 18% Preț: 989.93 lei
- 20% Preț: 968.30 lei
- 15% Preț: 623.93 lei
- 20% Preț: 637.75 lei
- 20% Preț: 642.59 lei
- 20% Preț: 905.58 lei
- 20% Preț: 1020.64 lei
- 20% Preț: 1409.89 lei
- 18% Preț: 708.27 lei
- 20% Preț: 1027.52 lei
- 20% Preț: 1137.02 lei
- 20% Preț: 903.17 lei
- 20% Preț: 1591.53 lei
- 20% Preț: 327.16 lei
- 20% Preț: 1018.73 lei
- 20% Preț: 969.72 lei
- 20% Preț: 980.78 lei
- 20% Preț: 967.80 lei
- 20% Preț: 637.10 lei
Preț: 1147.71 lei
Preț vechi: 1434.64 lei
-20% Nou
Puncte Express: 1722
Preț estimativ în valută:
219.72€ • 228.39$ • 182.17£
219.72€ • 228.39$ • 182.17£
Carte tipărită la comandă
Livrare economică 06-20 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319693071
ISBN-10: 3319693077
Pagini: 370
Ilustrații: XX, 421 p. 51 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.79 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Studies in Big Data
Locul publicării:Cham, Switzerland
ISBN-10: 3319693077
Pagini: 370
Ilustrații: XX, 421 p. 51 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.79 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Studies in Big Data
Locul publicării:Cham, Switzerland
Cuprins
Introduction.- Cluster Analysis .- Algorithms of combinatorial cluster analysis .- Cluster quality versus choice of parameters .- Spectral clustering .- Community discovery and identification.- Data sets.
Textul de pe ultima copertă
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.
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.
Caracteristici
Provides the reader with a basic understanding of the formal concepts of the cluster, clustering, partition, and cluster analysis Presents a number of approaches to handling a large number of objects within a reasonable time Presents recent research on cluster analysis Includes supplementary material: sn.pub/extras