國立虎尾科技大學 |

Partitional clustering algorithms

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Partitional clustering algorithms/ edited by M. Emre Celebi.
other author:	Celebi, M. Emre.
Published:	Cham :Springer International Publishing : : 2015.,
Description:	x, 415 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
Subject:	Cluster analysis. -
Online resource:	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:

562949
Cluster analysis.

LC Class. No.: TK5105.7

Dewey Class. No.: 005.7

Partitional clustering algorithms
LDR:02917nam a2200313 a 4500 001 835106
003 DE-He213
005 20150714112335.0
006 m d
007 cr nn 008maaau
008 160421s2015 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 : $c 2015. $b Springer International Publishing : $b Imprint: Springer,
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 562949
650 0 $a Computer algorithms. $3 528448
650 1 4 $a Engineering. $3 561152
650 2 4 $a Communications Engineering, Networks. $3 669809
650 2 4 $a Information Systems and Communication Service. $3 669203
650 2 4 $a Signal, Image and Speech Processing. $3 670837
700 1 $a Celebi, M. Emre. $3 1020220
710 2 $a SpringerLink (Online service) $3 593884
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)