國立高雄大學圖資館 |

Language: English

Back

Modern algorithms of cluster analysis

Klopotek, Mieczyslaw.

Modern algorithms of cluster analysis

Record Type:	Electronic resources : Monograph/item
Title/Author:	Modern algorithms of cluster analysisby Slawomir Wierzchon, Mieczyslaw Klopotek.
Author:	Wierzchon, Slawomir.
other author:	Klopotek, Mieczyslaw.
Published:	Cham :Springer International Publishing :2018.
Description:	xx, 421 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Cluster analysis.
Online resource:	http://dx.doi.org/10.1007/978-3-319-69308-8
ISBN:	9783319693088$q(electronic bk.)

Modern algorithms of cluster analysis
Wierzchon, Slawomir.

Modern algorithms of cluster analysis[electronic resource] /by Slawomir Wierzchon, Mieczyslaw Klopotek. - Cham :Springer International Publishing :2018. - xx, 421 p. :ill., digital ;24 cm. - Studies in big data,v.342197-6503 ;. - Studies in big data ;v.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.

ISBN: 9783319693088$q(electronic bk.)

Standard No.: 10.1007/978-3-319-69308-8doiSubjects--Topical Terms:

182711
Cluster analysis.

LC Class. No.: QA278 / .W547 2018

Dewey Class. No.: 006.3

Modern algorithms of cluster analysis
LDR:02428nmm a2200313 a 4500 001 529946
003 DE-He213
005 20180807135014.0
006 m d
007 cr nn 008maaau
008 181107s2018 gw s 0 eng d
020 $a 9783319693088$q(electronic bk.)
020 $a 9783319693071$q(paper)
024 7 $a 10.1007/978-3-319-69308-8 $2 doi
035 $a 978-3-319-69308-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA278 $b .W547 2018
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
082 0 4 $a 006.3 $2 23
090 $a QA278 $b .W648 2018
100 1 $a Wierzchon, Slawomir. $3 803437
245 1 0 $a Modern algorithms of cluster analysis $h [electronic resource] / $c by Slawomir Wierzchon, Mieczyslaw Klopotek.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xx, 421 p. : $b ill., digital ; $c 24 cm.
490 1 $a Studies in big data, $x 2197-6503 ; $v v.34
520 $a 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.
650 0 $a Cluster analysis. $3 182711
650 0 $a Computer algorithms. $3 184478
650 1 4 $a Engineering. $3 210888
650 2 4 $a Computational Intelligence. $3 338479
650 2 4 $a Big Data. $3 760530
650 2 4 $a Applications of Mathematics. $3 273744
650 2 4 $a Big Data/Analytics. $3 742047
700 1 $a Klopotek, Mieczyslaw. $3 803438
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Studies in big data ; $v v.1. $3 675357
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-69308-8
950 $a Engineering (Springer-11647)