Partitional Clustering Algorithms - Info and Reading Options

Open Data:

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

Search for “Partitional Clustering Algorithms” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Partitional Clustering Algorithms” in Libraries Near You:

Read or borrow “Partitional Clustering Algorithms” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Partitional Clustering Algorithms” at a library near you.