Constructing principal manifolds in sparse data sets by self-organizing maps with self-regulating neighborhood width

R. Der, G. Balzuweit, M. Herrmann

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

Abstract

We study the extraction of principal manifolds (PMs) in high-dimensional spaces with modified self-organizing feature maps. Our algorithm embeds a lower-dimensional lattice into a high-dimensional space without topology violations by tuning the neighborhood widths locally. Topology preservation, however, is not sufficient for determining PMs. It still allows for considerable deviations from the PM and is rather unreliable in the case of sparse data sets. These two problems are solved by the introduction of a new principle exploiting the specific dynamical properties of the first-order phase transition induced by dimensional conflicts
Original languageEnglish
Title of host publicationNeural Networks, 1996., IEEE International Conference on
PublisherInstitute of Electrical and Electronics Engineers
Pages480-483
Number of pages5
Volume1
ISBN (Print)0-7803-3210-5
DOIs
Publication statusPublished - 1 Jun 1996

Keywords / Materials (for Non-textual outputs)

  • data handling
  • learning (artificial intelligence)
  • network topology
  • self-organising feature maps
  • wavelet transforms
  • first-order phase transition
  • high-dimensional space
  • lower-dimensional lattice
  • neighborhood width
  • parameter learning
  • principal manifolds
  • self-organizing maps
  • sparse data sets
  • topology preserving map
  • Data mining
  • Fluctuations
  • Informatics
  • Information representation
  • Lattices
  • Neurons
  • Phase measurement
  • Scattering
  • Self organizing feature maps
  • Topology

Fingerprint

Dive into the research topics of 'Constructing principal manifolds in sparse data sets by self-organizing maps with self-regulating neighborhood width'. Together they form a unique fingerprint.

Cite this