Batch and median neural gas

Details Batch and median neural gas Batch and median neural gas

2006-10-18

arxiv.org/abs/math/0610561v1

Neural networks 19 (07/2006) 762-771

Mathematics

Statistics Theory

In Special Issue after WSOM 05 Conference, 5-8 september, 2005, Paris

Scientific paper

10.1016/j.neunet.2006.05.018

Neural Gas (NG) constitutes a very robust clustering algorithm given euclidian data which does not suffer from the problem of local minima like simple vector quantization, or topological restrictions like the self-organizing map. Based on the cost function of NG, we introduce a batch variant of NG which shows much faster convergence and which can be interpreted as an optimization of the cost function by the Newton method. This formulation has the additional benefit that, based on the notion of the generalized median in analogy to Median SOM, a variant for non-vectorial proximity data can be introduced. We prove convergence of batch and median versions of NG, SOM, and k-means in a unified formulation, and we investigate the behavior of the algorithms in several experiments.

Affiliated with

Also associated with

No associations

Rating

Batch and median neural gas 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 Batch and median neural gas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Batch and median neural gas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-99881