Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Partitional clustering algorithms / [edited by] Emre Celebi.

Contributor(s): Material type: TextTextPublication details: Cham : Springer, 2015.Description: x, 415 p. : illustrations (some color) ; 25 cmISBN:
  • 9783319092584 (hard cover : alk. paper)
Subject(s): DDC classification:
  • 000SA.072 23 C392
Contents:
1. Recent developments in model-based clustering with applications -- 2. Accelerating Lloyd?s algorithm for k-means clustering -- 3. Linear, Deterministic, and Order-Invariant Initialization Methods for the K-Means Clustering Algorithm -- 4. Nonsmooth optimization based algorithms in cluster analysis -- 5. Fuzzy Clustering Algorithms and Validity Indices for Distributed Data -- 6. Density Based Clustering: Alternatives to DBSCAN -- 7. Nonnegative matrix factorization for interactive topic modeling and document clustering -- 8. Overview of overlapping partitional clustering methods -- 9. On Semi-Supervised Clustering -- 10. Consensus of Clusterings based on High-order Dissimilarities -- 11. Hubness-Based Clustering of High-Dimensional Data -- 12. Clustering for Monitoring Distributed Data Streams.
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.
Tags from this library: No tags from this library for this title. Log in to add tags.

Includes bibliographical references.

1. Recent developments in model-based clustering with applications --
2. Accelerating Lloyd?s algorithm for k-means clustering --
3. Linear, Deterministic, and Order-Invariant Initialization Methods for the K-Means Clustering Algorithm --
4. Nonsmooth optimization based algorithms in cluster analysis --
5. Fuzzy Clustering Algorithms and Validity Indices for Distributed Data --
6. Density Based Clustering: Alternatives to DBSCAN --
7. Nonnegative matrix factorization for interactive topic modeling and document clustering --
8. Overview of overlapping partitional clustering methods --
9. On Semi-Supervised Clustering --
10. Consensus of Clusterings based on High-order Dissimilarities --
11. Hubness-Based Clustering of High-Dimensional Data --
12. 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.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in