Partitional clustering algorithms /

Saved in:
Bibliographic Details
Imprint:Cham : Springer, 2015.
©2015
Description:1 online resource (425 pages) : illustrations
Language:English
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11089479
Hidden Bibliographic Details
Other authors / contributors:Celebi, M. Emre, editor.
ISBN:9783319092591
3319092596
9783319092584
3319092588
9783319092584
Notes:Includes bibliographical references.
Print version record.
Summary: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.
Other form:Print version: Partitional Clustering Algorithms. Emre, M. Emre 3319092588
Standard no.:10.1007/978-3-319-09259-1