A massively parallel architecture for a self-organizing neural pattern recognition machine
Computer Vision, Graphics, and Image Processing
Fast algorithms for projected clustering
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Finding generalized projected clusters in high dimensional spaces
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Neural networks for clustering: theory, architecture, algorithm and neural dynamics
Neural networks for clustering: theory, architecture, algorithm and neural dynamics
Dynamics of projective adaptive resonance theory model: the foundation of PART algorithm
IEEE Transactions on Neural Networks
Spontaneous clustering via minimum gamma-divergence
Neural Computation
Hi-index | 0.00 |
We develop a new neural network architecture for projective clustering of data sets that incorporates adaptive transmission delays and signal transmission information loss. The resultant selective output signaling mechanism does not require the addition of multiple hidden layers but instead is based on the assumption that the signal transmission velocity between input processing neurons and clustering neurons is proportional to the similarity between the input pattern and the feature vector (the top-down weights) of the clustering neuron. The mathematical model governing the evolution of the signal transmission delay, the short-term memory traces, and the long-term memory traces represents a new class of large-scale delay differential equations where the evolution of the delay is described by a nonlinear differential equation involving the similarity measure already noted. We give a complete description of the computational performance of the network for a wide range of parameter values.