Algorithms for Clustering Data
by Anil K. Jain, Richard C. Dubes
Publisher: Prentice Hall 1988
ISBN/ASIN: 013022278X
ISBN-13: 9780130222787
Number of pages: 334
Description:
This book will be useful for those in the scientific community who gather data and seek tools for analyzing and interpreting data. It will be a valuable reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.
Download or read it online for free here:
Download link
(39MB, PDF)
Similar books
Problem Solving with Algorithms and Data Structures Using Pythonby Brad Miller, David Ranum - Franklin, Beedle & Associates
This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.
(23169 views)
Vector Models for Data-Parallel Computingby Guy Blelloch - The MIT Press
Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.
(14659 views)
Efficient Algorithms for Sorting and Synchronizationby Andrew Tridgell - samba.org
This thesis presents efficient algorithms for parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on efficient but incorrect algorithms followed by a cleanup phase that completes the sort.
(15697 views)
Open Data Structures: An Introductionby Pat Morin - AU Press
Offered as an introduction to the field of data structures and algorithms, the book covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.
(18907 views)