Share Email Print

Proceedings Paper

Adaptive clustering based on local neighborhood interactions
Author(s): Markus Anderle; Michael J. Kirby
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We propose a clustering algorithm that dynamically inserts and relocates cluster units based only on their interaction with neighboring clusters and data points. This leads to update and allocation procedures for centers locations based on local data distributions. These local data distributions can be uncovered by examining neighboring clusters or local interconnections between center locations. The consequence of only adapting nearest centers to a newly inserted cluster unit is a significant reduction in the necessary computational power for finding the center distribution that reduces the global distortion error. The proposed algorithm inserts new cluster units based on local distortion errors and utility measures, and uses a local LBG routine to integrate the new unit. Experiments have shown that it is not necessary to let the LBG routine converge in order to achieve integration of the new unit; the number of necessary iterations is instead determined by the center distribution in the neighborhood of new units. The algorithm thus offers a considerable speedup compared to conventional clustering algorithms that take the entire data set into account when inserting or relocating cluster units.

Paper Details

Date Published: 2 November 1999
PDF: 10 pages
Proc. SPIE 3807, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, (2 November 1999); doi: 10.1117/12.367645
Show Author Affiliations
Markus Anderle, Colorado State Univ. (United States)
Michael J. Kirby, Colorado State Univ. (United States)

Published in SPIE Proceedings Vol. 3807:
Advanced Signal Processing Algorithms, Architectures, and Implementations IX
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top