語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Modern Algorithms of Cluster Analysis
~
Kłopotek, Mieczyslaw.
Modern Algorithms of Cluster Analysis
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Modern Algorithms of Cluster Analysis/ by Slawomir Wierzchoń, Mieczyslaw Kłopotek.
作者:
Wierzchoń, Slawomir.
其他作者:
Kłopotek, Mieczyslaw.
面頁冊數:
XX, 421 p. 51 illus.online resource. :
Contained By:
Springer Nature eBook
標題:
Computational intelligence. -
電子資源:
https://doi.org/10.1007/978-3-319-69308-8
ISBN:
9783319693088
Modern Algorithms of Cluster Analysis
Wierzchoń, Slawomir.
Modern Algorithms of Cluster Analysis
[electronic resource] /by Slawomir Wierzchoń, Mieczyslaw Kłopotek. - 1st ed. 2018. - XX, 421 p. 51 illus.online resource. - Studies in Big Data,342197-6503 ;. - Studies in Big Data,8.
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:
568984
Computational intelligence.
LC Class. No.: Q342
Dewey Class. No.: 006.3
Modern Algorithms of Cluster Analysis
LDR
:02815nam a22003975i 4500
001
986776
003
DE-He213
005
20200630125657.0
007
cr nn 008mamaa
008
201225s2018 gw | s |||| 0|eng d
020
$a
9783319693088
$9
978-3-319-69308-8
024
7
$a
10.1007/978-3-319-69308-8
$2
doi
035
$a
978-3-319-69308-8
050
4
$a
Q342
072
7
$a
UYQ
$2
bicssc
072
7
$a
TEC009000
$2
bisacsh
072
7
$a
UYQ
$2
thema
082
0 4
$a
006.3
$2
23
100
1
$a
Wierzchoń, Slawomir.
$e
author.
$4
aut
$4
http://id.loc.gov/vocabulary/relators/aut
$3
1279311
245
1 0
$a
Modern Algorithms of Cluster Analysis
$h
[electronic resource] /
$c
by Slawomir Wierzchoń, Mieczyslaw Kłopotek.
250
$a
1st ed. 2018.
264
1
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2018.
300
$a
XX, 421 p. 51 illus.
$b
online resource.
336
$a
text
$b
txt
$2
rdacontent
337
$a
computer
$b
c
$2
rdamedia
338
$a
online resource
$b
cr
$2
rdacarrier
347
$a
text file
$b
PDF
$2
rda
490
1
$a
Studies in Big Data,
$x
2197-6503 ;
$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
Computational intelligence.
$3
568984
650
0
$a
Big data.
$3
981821
650
0
$a
Applied mathematics.
$3
1069907
650
0
$a
Engineering mathematics.
$3
562757
650
1 4
$a
Computational Intelligence.
$3
768837
650
2 4
$a
Big Data.
$3
1017136
650
2 4
$a
Applications of Mathematics.
$3
669175
650
2 4
$a
Big Data/Analytics.
$3
1106909
700
1
$a
Kłopotek, Mieczyslaw.
$e
author.
$4
aut
$4
http://id.loc.gov/vocabulary/relators/aut
$3
1279312
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783319693071
776
0 8
$i
Printed edition:
$z
9783319693095
776
0 8
$i
Printed edition:
$z
9783319887524
830
0
$a
Studies in Big Data,
$x
2197-6503 ;
$v
8
$3
1256918
856
4 0
$u
https://doi.org/10.1007/978-3-319-69308-8
912
$a
ZDB-2-ENG
912
$a
ZDB-2-SXE
950
$a
Engineering (SpringerNature-11647)
950
$a
Engineering (R0) (SpringerNature-43712)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入