Image from Google Jackets

Modern Algorithms of Cluster Analysis / by Slawomir Wierzchoń, Mieczyslaw Kłopotek.

By: Wierzchoń, Slawomir., autor.
Contributor(s): Kłopotek, Mieczyslaw., autor.
Material type: materialTypeLabelE-bookSeries: (Studies in Big Data,, 2197-6503; 34); (Engineering (Springer-11647)).Publisher: Cham : Springer International Publishing, 2018Description: 1 recurso en línea (XX, 421 páginas 51 ilustraciones).ISBN: 9783319693088.Subject: Ingeniería asistida por ordenador | Datos masivos | Matemáticas | Inteligencia artificialOnline resources: Acceso a este recurso digital (usuarios Universidad Europea de Madrid)Digital Resources Abstract: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
LIBRO-E NO PRÉSTAMO LIBRO-E NO PRÉSTAMO Madrid Digital Acceso Electrónico (UEM) Ciencias e Ingeniería Q342 2018 EB (Browse shelf(Opens below)) Acceso electrónico eBook.15112131
Total holds: 0

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.

There are no comments on this title.

to post a comment.
Share