scispace - formally typeset
B

Bernd Fritzke

Researcher at Ruhr University Bochum

Publications -  13
Citations -  4462

Bernd Fritzke is an academic researcher from Ruhr University Bochum. The author has contributed to research in topics: Vector quantization & Self-organizing map. The author has an hindex of 12, co-authored 13 publications receiving 4304 citations. Previous affiliations of Bernd Fritzke include International Computer Science Institute.

Papers
More filters
Proceedings Article

A Growing Neural Gas Network Learns Topologies

TL;DR: An incremental network model is introduced which is able to learn the important topological relations in a given set of input vectors by means of a simple Hebb-like learning rule.
Journal ArticleDOI

Growing cell structures—a self-organizing network for unsupervised and supervised learning

Bernd Fritzke
- 01 Nov 1994 - 
TL;DR: A new self-organizing neural network model that has two variants that performs unsupervised learning and can be used for data visualization, clustering, and vector quantization is presented and results on the two-spirals benchmark and a vowel classification problem are presented that are better than any results previously published.
Journal ArticleDOI

Growing Grid — a self-organizing network with constant neighborhood range and adaptation strength

TL;DR: A novel self-organizing network which is generated by a growth process where both the neighborhood range used to co-adapt units in the vicinity of the winning unit and the adaptation strength are constant during the growth phase.
Book ChapterDOI

A Self-Organizing Network that Can Follow Non-stationary Distributions

TL;DR: A new on-line criterion for identifying “useless” neurons of a self-organizing network is proposed and the resulting method is able to closely track nonstationary distributions.
Journal ArticleDOI

Fast learning with incremental RBF networks

TL;DR: A new algorithm for the construction of radial basis function (RBF) networks that is able to generate small, well-generalizing networks with comparably few sweeps through the training data is presented.