Weight convergence and weight density of the multi-dimensional SOFM algorithm

Siming Lin, Jennie Si

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

In this paper, we analyze convergence properties of the self-organizing feature map (SOFM) with multi-dimensional input using Robbins-Monro stochastic approximation principle. It is shown that the SOFM algorithm optimizes a well defined energy function and converges almost truly (i.e. with probability one) if the input data is from a discrete stochastic distribution. For the case of multi-dimensional inputs generated from continuous distributions, it is shown that the weights of the SOFM algorithm converge almost truly to the centroids of the cells of a Voronoi partition of the input space if the neighborhood function satisfies some reasonable conditions. The density of the weight space in the equilibrium states is also investigated.

Original languageEnglish (US)
Title of host publicationProceedings of the American Control Conference
PublisherIEEE
Pages2404-2408
Number of pages5
Volume4
StatePublished - 1997
EventProceedings of the 1997 American Control Conference. Part 3 (of 6) - Albuquerque, NM, USA
Duration: Jun 4 1997Jun 6 1997

Other

OtherProceedings of the 1997 American Control Conference. Part 3 (of 6)
CityAlbuquerque, NM, USA
Period6/4/976/6/97

Fingerprint

Self organizing maps

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Lin, S., & Si, J. (1997). Weight convergence and weight density of the multi-dimensional SOFM algorithm. In Proceedings of the American Control Conference (Vol. 4, pp. 2404-2408). IEEE.

Weight convergence and weight density of the multi-dimensional SOFM algorithm. / Lin, Siming; Si, Jennie.

Proceedings of the American Control Conference. Vol. 4 IEEE, 1997. p. 2404-2408.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lin, S & Si, J 1997, Weight convergence and weight density of the multi-dimensional SOFM algorithm. in Proceedings of the American Control Conference. vol. 4, IEEE, pp. 2404-2408, Proceedings of the 1997 American Control Conference. Part 3 (of 6), Albuquerque, NM, USA, 6/4/97.
Lin S, Si J. Weight convergence and weight density of the multi-dimensional SOFM algorithm. In Proceedings of the American Control Conference. Vol. 4. IEEE. 1997. p. 2404-2408
Lin, Siming ; Si, Jennie. / Weight convergence and weight density of the multi-dimensional SOFM algorithm. Proceedings of the American Control Conference. Vol. 4 IEEE, 1997. pp. 2404-2408
@inproceedings{8680c8d69cbe4a69a3a74a6afaa11e4e,
title = "Weight convergence and weight density of the multi-dimensional SOFM algorithm",
abstract = "In this paper, we analyze convergence properties of the self-organizing feature map (SOFM) with multi-dimensional input using Robbins-Monro stochastic approximation principle. It is shown that the SOFM algorithm optimizes a well defined energy function and converges almost truly (i.e. with probability one) if the input data is from a discrete stochastic distribution. For the case of multi-dimensional inputs generated from continuous distributions, it is shown that the weights of the SOFM algorithm converge almost truly to the centroids of the cells of a Voronoi partition of the input space if the neighborhood function satisfies some reasonable conditions. The density of the weight space in the equilibrium states is also investigated.",
author = "Siming Lin and Jennie Si",
year = "1997",
language = "English (US)",
volume = "4",
pages = "2404--2408",
booktitle = "Proceedings of the American Control Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Weight convergence and weight density of the multi-dimensional SOFM algorithm

AU - Lin, Siming

AU - Si, Jennie

PY - 1997

Y1 - 1997

N2 - In this paper, we analyze convergence properties of the self-organizing feature map (SOFM) with multi-dimensional input using Robbins-Monro stochastic approximation principle. It is shown that the SOFM algorithm optimizes a well defined energy function and converges almost truly (i.e. with probability one) if the input data is from a discrete stochastic distribution. For the case of multi-dimensional inputs generated from continuous distributions, it is shown that the weights of the SOFM algorithm converge almost truly to the centroids of the cells of a Voronoi partition of the input space if the neighborhood function satisfies some reasonable conditions. The density of the weight space in the equilibrium states is also investigated.

AB - In this paper, we analyze convergence properties of the self-organizing feature map (SOFM) with multi-dimensional input using Robbins-Monro stochastic approximation principle. It is shown that the SOFM algorithm optimizes a well defined energy function and converges almost truly (i.e. with probability one) if the input data is from a discrete stochastic distribution. For the case of multi-dimensional inputs generated from continuous distributions, it is shown that the weights of the SOFM algorithm converge almost truly to the centroids of the cells of a Voronoi partition of the input space if the neighborhood function satisfies some reasonable conditions. The density of the weight space in the equilibrium states is also investigated.

UR - http://www.scopus.com/inward/record.url?scp=0030652360&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030652360&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030652360

VL - 4

SP - 2404

EP - 2408

BT - Proceedings of the American Control Conference

PB - IEEE

ER -