東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Modern algorithms of cluster analysis

Wierzchon, Slawomir.

FindBook

Google Book

Amazon

博客來

Modern algorithms of cluster analysis

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Modern algorithms of cluster analysis/ by Slawomir Wierzchon, Mieczyslaw Klopotek.
作者:	Wierzchon, Slawomir.
其他作者:	Klopotek, Mieczyslaw.
出版者:	Cham :Springer International Publishing : : 2018.,
面頁冊數:	xx, 421 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Cluster analysis. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-69308-8
ISBN:	9783319693088

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.34..

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

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

562995
Cluster analysis.

LC Class. No.: QA278 / .W547 2018

Dewey Class. No.: 006.3

Modern algorithms of cluster analysis
LDR:02428nmm a2200313 a 4500 001 2132829
003 DE-He213
005 20180807135014.0
006 m d
007 cr nn 008maaau
008 181005s2018 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 3299718
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 562995
650 0 $a Computer algorithms. $3 523872
650 1 4 $a Engineering. $3 586835
650 2 4 $a Computational Intelligence. $3 1001631
650 2 4 $a Big Data. $3 3134868
650 2 4 $a Applications of Mathematics. $3 890893
650 2 4 $a Big Data/Analytics. $3 2186785
700 1 $a Klopotek, Mieczyslaw. $3 3299719
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Studies in big data ; $v v.34. $3 3299720
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-69308-8
950 $a Engineering (Springer-11647)