**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

**Algorithms and Complexity**

by

**Herbert S. Wilf**-

**AK Peters, Ltd.**

An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.

(

**17325**views)

**Algorithms and Data Structures**

by

**Niklaus Wirth**-

**Prentice Hall**

The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.

(

**14593**views)

**Algorithms**

by

**Ian Craw, John Pulham**-

**University of Aberdeen**

This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.

(

**12754**views)

**Planning Algorithms**

by

**Steven M. LaValle**-

**Cambridge University Press**

Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this book tightly integrates a vast body of literature from several fields into a coherent source for reference in applications.

(

**16537**views)