In this paper, we propose a novel artificial neural network, called self-adjusting feature map (SAM), and its unsupervised learning algorithm with self-adjusting mechanism. After the training of SAM network, we will obtain a map composed of a set of representative connected neurons. The trained network structure of representative connected neurons not only displays the spatial relation of the input data distribution but also quantizes the data well. SAM can automatically isolate a set of connected neurons, in which the number of the set may indicate the number of clusters to be used. The idea of self-adjusting mechanism is based on combining of mathematical statistics and neurological advance and retreat of waste. For each representative neuron, there are three periods, growth. adaptation and decline, in its training process. The network of representative neurons will first create the necessary neurons according to the local density of the input data in the growth period. Then it will adjust neighborhood neuron pair's connected/disconnected topology constantly according to the statistics of input feature data in the adaptation period. Lastly the unnecessary neurons of the network will be merged or deleted in the decline period. In this study. we exploit SAM to handle some peculiar cases that cannot be well dealt with by classical unsupervised learning networks such as self-organizing feature map (SOM) network. Furthermore, we also take several real world cases to exhibit the remarkable characteristics of SAM.
|Title of host publication||NEURAL INFORMATION PROCESSING, PT III|
|Publisher||Springer-Verlag Berlin Heidelberg|
|Number of pages||9|
|ISBN (Print)||978-3-642-24964-8, 978-3-642-24965-5|
|State||Published - 2011|
|Name||Lecture Notes in Computer Science|
- Unsupervised learning
- representative neurons statistics
Lin, C-T., Li, D-L., & Chang, J-Y. (2011). Self-Adjusting Feature Maps Network. In NEURAL INFORMATION PROCESSING, PT III (Vol. 7064, pp. 356-364). (Lecture Notes in Computer Science). Springer-Verlag Berlin Heidelberg.