東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Partitional clustering algorithms

Celebi, M. Emre.

FindBook

Google Book

Amazon

博客來

Partitional clustering algorithms

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Partitional clustering algorithms/ edited by M. Emre Celebi.
其他作者:	Celebi, M. Emre.
出版者:	Cham :Springer International Publishing : : 2015.,
面頁冊數:	x, 415 p. :ill., digital ;24 cm.
內容註:	Recent developments in model-based clustering with applications -- Accelerating Lloyd's algorithm for k-means clustering -- Linear, Deterministic, and Order-Invariant Initialization Methods for the K-Means Clustering Algorithm -- Nonsmooth optimization based algorithms in cluster analysis -- Fuzzy Clustering Algorithms and Validity Indices for Distributed Data -- Density Based Clustering: Alternatives to DBSCAN -- Nonnegative matrix factorization for interactive topic modeling and document clustering -- Overview of overlapping partitional clustering methods -- On Semi-Supervised Clustering -- Consensus of Clusterings based on High-order Dissimilarities -- Hubness-Based Clustering of High-Dimensional Data -- Clustering for Monitoring Distributed Data Streams.
Contained By:	Springer eBooks
標題:	Cluster analysis. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-09259-1
ISBN:	9783319092591 (electronic bk.)

Partitional clustering algorithms
Partitional clustering algorithms[electronic resource] /edited by M. Emre Celebi. - Cham :Springer International Publishing :2015. - x, 415 p. :ill., digital ;24 cm.

Recent developments in model-based clustering with applications -- Accelerating Lloyd's algorithm for k-means clustering -- Linear, Deterministic, and Order-Invariant Initialization Methods for the K-Means Clustering Algorithm -- Nonsmooth optimization based algorithms in cluster analysis -- Fuzzy Clustering Algorithms and Validity Indices for Distributed Data -- Density Based Clustering: Alternatives to DBSCAN -- Nonnegative matrix factorization for interactive topic modeling and document clustering -- Overview of overlapping partitional clustering methods -- On Semi-Supervised Clustering -- Consensus of Clusterings based on High-order Dissimilarities -- Hubness-Based Clustering of High-Dimensional Data -- Clustering for Monitoring Distributed Data Streams.

This book summarizes the state-of-the-art in partitional clustering. Clustering, the unsupervised classification of patterns into groups, is one of the most important tasks in exploratory data analysis. Primary goals of clustering include gaining insight into, classifying, and compressing data. Clustering has a long and rich history that spans a variety of scientific disciplines including anthropology, biology, medicine, psychology, statistics, mathematics, engineering, and computer science. As a result, numerous clustering algorithms have been proposed since the early 1950s. Among these algorithms, partitional (nonhierarchical) ones have found many applications, especially in engineering and computer science. This book provides coverage of consensus clustering, constrained clustering, large scale and/or high dimensional clustering, cluster validity, cluster visualization, and applications of clustering. Examines clustering as it applies to large and/or high-dimensional data sets commonly encountered in realistic applications; Discusses algorithms specifically designed for partitional clustering; Covers center-based, competitive learning, density-based, fuzzy, graph-based, grid-based, metaheuristic, and model-based approaches.

ISBN: 9783319092591 (electronic bk.)

Standard No.: 10.1007/978-3-319-09259-1doiSubjects--Topical Terms:

562995
Cluster analysis.

LC Class. No.: TK5105.7

Dewey Class. No.: 005.7

Partitional clustering algorithms
LDR:02917nmm a2200313 a 4500 001 1993555
003 DE-He213
005 20150714112335.0
006 m d
007 cr nn 008maaau
008 151019s2015 gw s 0 eng d
020 $a 9783319092591 (electronic bk.)
020 $a 9783319092584 (paper)
024 7 $a 10.1007/978-3-319-09259-1 $2 doi
035 $a 978-3-319-09259-1
040 $a GP $c GP
041 0 $a eng
050 4 $a TK5105.7
072 7 $a TJK $2 bicssc
072 7 $a TEC041000 $2 bisacsh
082 0 4 $a 005.7 $2 23
090 $a TK5105.7 $b .P273 2015
245 0 0 $a Partitional clustering algorithms $h [electronic resource] / $c edited by M. Emre Celebi.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a x, 415 p. : $b ill., digital ; $c 24 cm.
505 0 $a Recent developments in model-based clustering with applications -- Accelerating Lloyd's algorithm for k-means clustering -- Linear, Deterministic, and Order-Invariant Initialization Methods for the K-Means Clustering Algorithm -- Nonsmooth optimization based algorithms in cluster analysis -- Fuzzy Clustering Algorithms and Validity Indices for Distributed Data -- Density Based Clustering: Alternatives to DBSCAN -- Nonnegative matrix factorization for interactive topic modeling and document clustering -- Overview of overlapping partitional clustering methods -- On Semi-Supervised Clustering -- Consensus of Clusterings based on High-order Dissimilarities -- Hubness-Based Clustering of High-Dimensional Data -- Clustering for Monitoring Distributed Data Streams.
520 $a This book summarizes the state-of-the-art in partitional clustering. Clustering, the unsupervised classification of patterns into groups, is one of the most important tasks in exploratory data analysis. Primary goals of clustering include gaining insight into, classifying, and compressing data. Clustering has a long and rich history that spans a variety of scientific disciplines including anthropology, biology, medicine, psychology, statistics, mathematics, engineering, and computer science. As a result, numerous clustering algorithms have been proposed since the early 1950s. Among these algorithms, partitional (nonhierarchical) ones have found many applications, especially in engineering and computer science. This book provides coverage of consensus clustering, constrained clustering, large scale and/or high dimensional clustering, cluster validity, cluster visualization, and applications of clustering. Examines clustering as it applies to large and/or high-dimensional data sets commonly encountered in realistic applications; Discusses algorithms specifically designed for partitional clustering; Covers center-based, competitive learning, density-based, fuzzy, graph-based, grid-based, metaheuristic, and model-based approaches.
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 Communications Engineering, Networks. $3 891094
650 2 4 $a Information Systems and Communication Service. $3 891044
650 2 4 $a Signal, Image and Speech Processing. $3 891073
700 1 $a Celebi, M. Emre. $3 2055156
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-09259-1
950 $a Engineering (Springer-11647)