Modern Algorithms of Cluster Analysis
✍ Scribed by Slawomir Wierzchoń,Mieczyslaw Kłopotek (auth.)
- Publisher
- Springer International Publishing
- Year
- 2018
- Tongue
- English
- Leaves
- 433
- Series
- Studies in Big Data 34
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
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.
✦ Table of Contents
Front Matter ....Pages i-xx
Introduction (Sławomir T. Wierzchoń, Mieczysław A. Kłopotek)....Pages 1-7
Cluster Analysis (Sławomir T. Wierzchoń, Mieczysław A. Kłopotek)....Pages 9-66
Algorithms of Combinatorial Cluster Analysis (Sławomir T. Wierzchoń, Mieczysław A. Kłopotek)....Pages 67-161
Cluster Quality Versus Choice of Parameters (Sławomir T. Wierzchoń, Mieczysław A. Kłopotek)....Pages 163-180
Spectral Clustering (Sławomir T. Wierzchoń, Mieczysław A. Kłopotek)....Pages 181-259
Community Discovery and Identification in Empirical Graphs (Sławomir T. Wierzchoń, Mieczysław A. Kłopotek)....Pages 261-314
Data Sets (Sławomir T. Wierzchoń, Mieczysław A. Kłopotek)....Pages 315-317
Back Matter ....Pages 319-421
✦ Subjects
Computational Intelligence
📜 SIMILAR VOLUMES
Paper, 9 p.<br/>The paper deals with the cluster analysis and genetic algorithms and describes their basis. The application of genetic algorithms is focused on a cluster analysis as an optimization task. The case studies present the way of solution of two and three dimensional cluster analysis in MA
Department of Computing Imperial College of Science, Technology and Medicine<br/>University of London, London SW7 2AZ.<br/>A dissertation submitted in partial fulfilment of the requirements<br/>for the degree of Doctor of Philosophy of the University of London.<div class="bb-sep"></div>Abstract<br/>
<p>This book focuses on partitional clustering algorithms, which are commonly used in engineering and computer scientific applications. The goal of this volume is to summarize the state-of-the-art in partitional clustering. The book includes such topics as center-based clustering, competitive learni
Physica Verlag, 1985. — 134 p.<div class="bb-sep"></div>The objectives of this monograph are as follows: to collect together important recent algorithmic results in the area of cluster analysis; to indicate algorithms which may be of importance in parallel computing environme~ts; to include (unlike