Cantitate/Preț
Produs
Total produse
Vezi coșul
Partitional Clustering Algorithms de M. Emre Celebi

Partitional Clustering Algorithms

Editat de M. Emre Celebi
en Limba Engleză Hardback – 20 noi 2014
This book focuses on partitional clustering algorithms, which are commonly used in engineering and computer scientific applications. The goal of this volume is to summarize the state-of-the-art in partitional clustering. The book includes such topics as center-based clustering, competitive learning clustering and density-based clustering. Each chapter is contributed by a leading expert in the field.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 63586 lei  6-8 săpt.
  Springer International Publishing – 22 sep 2016 63586 lei  6-8 săpt.
Hardback (1) 64216 lei  6-8 săpt.
  Springer International Publishing – 20 noi 2014 64216 lei  6-8 săpt.

Preț: 64216 lei

Preț vechi: 75548 lei
-15% Nou

Puncte Express: 963
Preț estimativ în valută:
12290€ • 12835$ • 10189£

Carte tipărită la comandă

Livrare economică 11-25 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319092584
ISBN-10: 3319092588
Pagini: 415
Ilustrații: X, 415 p. 78 illus., 45 illus. in color.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.77 kg
Ediția:2015
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

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.

Recenzii

“The content of the book is really outstanding in terms of the clarity of the discourse and the variety of well-selected examples. … The book brings substantial contributions to the field of partitional clustering from both the theoretical and practical points of view, with the concepts and algorithms presented in a clear and accessible way. It addresses a wide range of readers, including scientists, students, and researchers.” (L. State, Computing Reviews, April, 2015)

Notă biografică

Dr. Emre Celebi is an Associate Professor with the Department of Computer Science, at Louisiana State University in Shreveport.

Textul de pe ultima copertă

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.

Caracteristici

Examines clustering as it applies to large and/or high-dimensional data sets commonly encountered in real-world 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 Includes supplementary material: sn.pub/extras