Paper
19 September 2001 Overview of clustering algorithms
Author Affiliations +
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.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Allyn Treshansky and Robert M. McGraw "Overview of clustering algorithms", Proc. SPIE 4367, Enabling Technology for Simulation Science V, (19 September 2001); https://doi.org/10.1117/12.440039
Lens.org Logo
CITATIONS
Cited by 18 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Distance measurement

Fuzzy logic

Neural networks

Evolutionary algorithms

Modeling and simulation

Algorithms

Data modeling

Back to Top