Adaptive clustering based on local neighborhood interactions

Statistics – Computation

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Adaptive clustering based on local neighborhood interactions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adaptive clustering based on local neighborhood interactions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive clustering based on local neighborhood interactions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1513865

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.