Share Email Print

Proceedings Paper

Overview of clustering algorithms
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Clustering algorithms are useful whenever one needs to classify an excessive amount of information into a set of manageable and meaningful subsets. Using an analogy from vector analysis, a clustering algorithm can be said to divide up state space into discrete chunks such that each vector lies within one chunk. These vectors can best be thought of as sets of features. A canonical vector for each region of state space is chosen to represent all vectors which are located within that region. The following paper presents a survey of clustering algorithms. It pays particular attention to those algorithms that require the least amount of a priori knowledge about the domain being clustered. In the current work, an algorithm is compelling to the extent that it minimizes any assumptions about the distribution of vectors being classified.

Paper Details

Date Published: 19 September 2001
PDF: 11 pages
Proc. SPIE 4367, Enabling Technology for Simulation Science V, (19 September 2001); doi: 10.1117/12.440039
Show Author Affiliations
Allyn Treshansky, RAM Labs., Inc. (United States)
Robert M. McGraw, RAM Labs., Inc. (United States)

Published in SPIE Proceedings Vol. 4367:
Enabling Technology for Simulation Science V
Alex F. Sisti; Dawn A. Trevisani, Editor(s)

© SPIE. Terms of Use
Back to Top