3 September 1993 Data-clustering algorithm using a self-organizing method
Author Affiliations +
Abstract
A new data clustering algorithm using a self organizing method is presented. This algorithm forms clusters and is trained without supervision. The clustering is done on the basis of the statistical properties of the set of data. This algorithm differs from the K-means algorithm and other clustering algorithms in that the number of desired clusters is not required to be known a priori. It also removes noise and is fast. The convergence of the algorithm is shown. An example is given to show the application of the algorithm to clustering data and to compare the results obtained using this algorithm with those obtained using the K-means algorithm.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Rustom Mamlook, Wiley E. Thompson, "Data-clustering algorithm using a self-organizing method", Proc. SPIE 1955, Signal Processing, Sensor Fusion, and Target Recognition II, (3 September 1993); doi: 10.1117/12.154977; https://doi.org/10.1117/12.154977
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT

Data analysis: models and alogrithms
Proceedings of SPIE (February 02 2001)
Reliability culture at La Silla Paranal Observatory
Proceedings of SPIE (July 29 2010)
Self-organizing k-means classification algorithm
Proceedings of SPIE (June 14 1996)
Pseudo k-means approach to the classifying problem
Proceedings of SPIE (July 09 1992)
Broadcast scheduling with data bundles
Proceedings of SPIE (May 23 2011)

Back to Top