Self-Adjusting Feature Maps Network

被引:0
|
作者
Lin, Chin-Teng [1 ]
Li, Dong-Lin [1 ]
Chang, Jyh-Yeong [1 ]
机构
[1] Natl Chiao Tung Univ, Inst Elect & Control Eng, Hsinchu, Taiwan
来源
关键词
Unsupervised learning; self-adjusting; representative neurons statistics; SOM; HARMONIC COMPETITION;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:356 / 364
页数:9
相关论文
共 50 条
  • [21] The dynamic self-adjusting EAF
    Ruscio, E
    Bergman, K
    Olund, S
    [J]. IRONMAKING & STEELMAKING, 2005, 32 (03) : 199 - 202
  • [22] Self-adjusting microstrip antenna
    Turki, Y
    Staraj, R
    [J]. ELECTRONICS LETTERS, 1999, 35 (02) : 106 - 107
  • [23] Imperative Self-Adjusting Computation
    Acar, Umut A.
    Ahmed, Amal
    Blume, Matthias
    [J]. POPL'08: PROCEEDINGS OF THE 35TH ANNUAL ACM SIGPLAN-SIGACT SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES, 2008, : 309 - 322
  • [24] A SELF-ADJUSTING CHIN SUPPORT
    DUNKIN, LJ
    [J]. LANCET, 1968, 2 (7558): : 45 - &
  • [25] Self-adjusting grid networks
    Avin, Chen
    van Duijn, Ingo
    Pacut, Maciej
    Schmid, Stefan
    [J]. INFORMATION AND COMPUTATION, 2023, 292
  • [26] The Self-Adjusting File system
    Metzger, Zvi
    Kfir, Anda
    Abramovitz, Itzhak
    Weissman, Amir
    Solomonov, Michael
    [J]. ENDO-ENDODONTIC PRACTICE TODAY, 2013, 7 (03): : 189 - 210
  • [27] Self-Adjusting Top Trees
    Tarjan, Robert E.
    Werneck, Renato F.
    [J]. PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 813 - 822
  • [28] SELF-ADJUSTING AND DISPENSING MICROPIPET
    GRUNBAUM, BW
    KIRK, PL
    [J]. ANALYTICAL CHEMISTRY, 1955, 27 (02) : 333 - 333
  • [29] Self-Adjusting Stack Machines
    Hammer, Matthew A.
    Neis, Georg
    Chen, Yan
    Acar, Umut A.
    [J]. OOPSLA 11: PROCEEDINGS OF THE 2011 ACM INTERNATIONAL CONFERENCE ON OBJECT ORIENTED PROGRAMMING SYSTEMS LANGUAGES AND APPLICATIONS, 2011, : 753 - 772
  • [30] Self-Adjusting Stack Machines
    Hammer, Matthew A.
    Neis, Georg
    Chen, Yan
    Acar, Umut A.
    [J]. ACM SIGPLAN NOTICES, 2011, 46 (10) : 753 - 772