Partitional Clustering Algorithms

Häftad, Engelska, 2016

1 409 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2016-09-22
Mått155 x 235 x 24 mm
Vikt645 g
FormatHäftad
SpråkEngelska
Antal sidor415
FörlagSpringer International Publishing AG
ISBN9783319347981

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Hårdvara inom Data och it
Elektronik och kommunikationer inom Naturvetenskap och teknik

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.

“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)