Cantitate/Preț
Produs

Modern Algorithms of Cluster Analysis: Studies in Big Data, cartea 34

Autor Slawomir Wierzchoń, Mieczyslaw Kłopotek
en Limba Engleză Paperback – 4 iun 2019
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.

Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 114141 lei  6-8 săpt.
  Springer International Publishing – 4 iun 2019 114141 lei  6-8 săpt.
Hardback (1) 114771 lei  6-8 săpt.
  Springer International Publishing – 29 ian 2018 114771 lei  6-8 săpt.

Din seria Studies in Big Data

Preț: 114141 lei

Preț vechi: 142676 lei
-20% Nou

Puncte Express: 1712

Preț estimativ în valută:
21851 22713$ 18117£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319887524
ISBN-10: 3319887521
Pagini: 421
Ilustrații: XX, 421 p. 51 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.62 kg
Ediția:Softcover reprint of the original 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.


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