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.
Explore Partitional Clustering Algorithms by M. Emre Celebi on eBooksStore by Arnlweb. Discover book details, reader ratings, reviews, release information, genres, and related digital books available through the iTunes Store.
This book is part of our growing collection of bestselling eBooks, popular digital reading materials, and trending author releases. Readers can explore similar books, discover new authors, and browse related genres including fiction, romance, mystery, fantasy, business, self-help, educational books, and more.
Our platform helps readers discover highly rated digital books optimized for smartphones, tablets, laptops, and desktop devices. Browse fast-loading book pages, reader reviews, and popular recommendations from bestselling authors worldwide.