Partitional Clustering Algorithms / / edited by M. Emre Celebi

• Record Nr.: UNINA9910299849303321
• Pubbl/distr/stampa: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
• ISBN: 3-319-09259-6
• Edizione: [1st ed. 2015.]
• Descrizione fisica: 1 online resource (420 p.)
• Disciplina: 005.7; 620; 621.382
• Soggetti: Electrical engineering; Computers; Signal processing; Image processing; Speech processing systems; Communications Engineering, Networks; Information Systems and Communication Service; Signal, Image and Speech Processing
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Description based upon print version of record.
• Nota di bibliografia: Includes bibliographical references at the end of each chapters.
• Nota di contenuto: 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.
• Sommario/riassunto: 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.