An Incremental Local Distribution Network for Unsupervised Learning
Lecture notes in computer sciencePublished 1 January 2015
Youlu Xing, Tongyi Cao, Ke Zhou, Furao Shen, Jinxi Zhao
Citations2
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An Incremental Local Distribution Network for unsupervised learning, which combines the merits of matrix learning and incremental learning, has a statistics based merging mechanism and thus can obtain a precise and concise representation of the learning data called relaxation representa- tion.
Abstract
We present an Incremental Local Distribution Network (ILDN) for unsupervised learning, which combines the merits of matrix learning and incremental learning. It stores local distribution information in each node with covariant matrix and uses a vigilance parameter with statistical support to decide whether to extend the network. It has a statistics based merging mechanism and thus can obtain a precise and concise representation of the learning data called relaxation representation. Moreover, the denoising process based on data density makes ILDN robust to noise and practically useful. Experiments on artificial and real-world data in both "closed" and "open-ended" environment show the better accuracy, conciseness, and efficiency of ILDN over other methods.
Keywords
Computer Science
IEEE Transactions on Information TheoryLeast squares quantization in PCM
15,578 Citations1982Sheelagh Lloyd
The corresponding result for any finite number of quanta is derived; that is, necessary conditions are found that the quanta and associated quantization intervals of an optimum finite quantization scheme must satisfy.
Biological CyberneticsSelf-organized formation of topologically correct feature maps
9,519 Citations1982Teuvo Kohonen
In a simple network of adaptive physical elements which receives signals from a primary event space, the signal representations are automatically mapped onto a set of output responses in such a way that the responses acquire the same topological order as that of the primary events.
A Growing Neural Gas Network Learns Topologies
1,611 Citations1994Bernd Fritzke
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.
IEEE Transactions on Neural Networks'Neural-gas' network for vector quantization and its application to time-series prediction
1,436 Citations1993Thomas Martinetz, S.G. Berkovich +1 more
It is shown that the dynamics of the reference (weight) vectors during the input-driven adaptation procedure are determined by the gradient of an energy function whose shape can be modulated through a neighborhood determining parameter and resemble the dynamicsof Brownian particles moving in a potential determined by a data point density.
ComputerThe ART of adaptive pattern recognition by a self-organizing neural network
1,290 Citations1988Gail A. Carpenter, Stephen Grossberg
Neural NetworksTopology representing networks
887 Citations1994Thomas Martinetz, Klaus Schulten
This competitive Hebbian rule provides a novel approach to the problem of constructing topology preserving feature maps and representing intricately structured manifolds and makes this novel approach particularly useful in all applications where neighborhood relations have to be exploited or the shape and topology of submanifolds have to been take into account.
IEEE Transactions on Neural NetworksDynamic self-organizing maps with controlled growth for knowledge discovery
533 Citations2000Damminda Alahakoon, Saman Halgamuge +1 more
The growing self-organizing map (GSOM) is presented in detail and the effect of a spread factor, which can be used to measure and control the spread of the GSOM, is investigated.
Neural NetworksA self-organising network that grows when required
383 Citations2002Stephen Marsland, Jonathan Shapiro +1 more
A way in which the learning algorithm can add nodes whenever the network in its current state does not sufficiently match the input is suggested, so that the network grows very quickly when new data is presented, but stops growing once the network has matched the data.
Pattern RecognitionMultivariate online kernel density estimation with Gaussian kernels
189 Citations2011Matej Kristan, Aleš Leonardis +1 more
This document includes some detailed supplemental derivations used in the bandwidth estimation for the online Kernel Density Estimator which was proposed in the paper \Multivariate Online Kernel D density Estimation with Gaussian Kernels.
IEEE Transactions on Neural NetworksSelf-organizing mixture networks for probability density estimation
126 Citations2001Hujun Yin, N.M. Allinson
A self-organizing mixture network (SOMN) derived for learning arbitrary density functions that minimizes the Kullback-Leibler information metric by means of stochastic approximation methods and can provide an insight to the role of neighborhood function used in the SOM.
Neural NetworksA fast nearest neighbor classifier based on self-organizing incremental neural network
114 Citations2008Furao Shen, Osamu Hasegawa
The proposed Adjusted SOINn Classifier (ASC) is based on SOINN (self-organizing incremental neural network), it automatically learns the number of prototypes needed to determine the decision boundary, and learns new information without destroying old learned information.
Neural NetworksA principal components analysis self-organizing map
38 Citations2003Ezequiel López‐Rubio, José Muñoz Pérez +1 more
A new self-organizing neural model that performs principal components analysis and has better performance than the ASSOM network is proposed.
IEEE Transactions on Neural NetworksProbabilistic Self-Organizing Maps for Continuous Data
32 Citations2010Ezequiel López‐Rubio
Here, a comprehensive view of the state of the art is presented, with a unifying perspective of the involved theoretical frameworks, of the most commonly used continuous probability distributions, self-organization mechanisms, and learning schemes.
ACM Computing SurveysSelf-organizing maps with a time-varying structure
30 Citations2013A.F.R. Araujo, Renata L. M. E. do Rego
A framework to describe SOM-TVS models is proposed, which is used to describe some of these models and to compare their algorithms, and some real-world applications of the models presented are presented.
NeurocomputingLocal matrix adaptation in topographic neural maps
27 Citations2010Banchar Arnonkijpanich, Alexander Hasenfuß +1 more
This contribution establishes a link of models which rely on local principal components (PCA), matrix learning, and a formal cost function of NG and SOM which allows to show convergence of the algorithm, and obtains batch optimization learning rules for prototype and matrix adaptation based on these generalized cost functions.
Neural NetworksA hierarchical ART network for the stable incremental learning of topological structures and associations from noisy data
23 Citations2011Marko Tscherepanow, Marco Kortkamp +1 more
A novel unsupervised neural network combining elements from Adaptive Resonance Theory and topology-learning neural networks is presented, which enables stable on-line clustering of stationary and non-stationary input data by learning their inherent topology.
NeurocomputingA new local PCA-SOM algorithm
15 Citations2007Dong Huang, Yi Zhang +1 more
A local PCA-SOM algorithm is proposed that is computational efficient, and implicitly incorporates the Mahalanobis distance and the reconstruction error, and no priori information of the optimal principal subspace is required.