Soft Competitive Learning and Growing Self-Organizing Neural Networks for Pattern Classification

Guojian Cheng, Tianshi Liu, Kuisheng Wang, Jiaxin Han
{"title":"Soft Competitive Learning and Growing Self-Organizing Neural Networks for Pattern Classification","authors":"Guojian Cheng, Tianshi Liu, Kuisheng Wang, Jiaxin Han","doi":"10.1109/SYNASC.2006.68","DOIUrl":null,"url":null,"abstract":"Competitive learning can be defined as an adaptive process in which the neurons in an artificial neural network gradually become sensitive to different input categories which are sets of patterns in a specific domain of the input space. By using competitive learning, Kohonen's self-organizing maps (KSOM) can generate mappings from high-dimensional signal spaces to lower dimensional topological structures. The main features of KSOM are formation of topology preserving feature maps and approximation of input probability distribution. However, KSOM have some shortages, e.g., a fixed number of neural units and a fixed topology dimensionality which can result in problems if this dimensionality does not match the dimensionality of the feature manifold. Compared to KSOM, growing self-organizing neural networks (GSONN) can change their topological structures during learning. The topology formation of both GSONN and KSOM is driven by soft competitive learning. This paper first gives an introduction to KSOM and neural gas network. Then, we discuss some GSONN without fixed dimensionality such as growing neural gas and the author's model: twin growing neural gas and it's application for pattern classification. It is ended with some conclusions","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2006.68","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Competitive learning can be defined as an adaptive process in which the neurons in an artificial neural network gradually become sensitive to different input categories which are sets of patterns in a specific domain of the input space. By using competitive learning, Kohonen's self-organizing maps (KSOM) can generate mappings from high-dimensional signal spaces to lower dimensional topological structures. The main features of KSOM are formation of topology preserving feature maps and approximation of input probability distribution. However, KSOM have some shortages, e.g., a fixed number of neural units and a fixed topology dimensionality which can result in problems if this dimensionality does not match the dimensionality of the feature manifold. Compared to KSOM, growing self-organizing neural networks (GSONN) can change their topological structures during learning. The topology formation of both GSONN and KSOM is driven by soft competitive learning. This paper first gives an introduction to KSOM and neural gas network. Then, we discuss some GSONN without fixed dimensionality such as growing neural gas and the author's model: twin growing neural gas and it's application for pattern classification. It is ended with some conclusions
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
模式分类的软竞争学习与成长自组织神经网络
竞争性学习可以定义为人工神经网络中的神经元对不同输入类别逐渐变得敏感的自适应过程,这些类别是输入空间特定域内的模式集。通过竞争学习,Kohonen的自组织映射(KSOM)可以生成从高维信号空间到低维拓扑结构的映射。KSOM的主要特点是拓扑保持特征映射的形成和输入概率分布的逼近。然而,KSOM存在一些不足,例如固定数量的神经单元和固定的拓扑维数,如果该维数与特征流形的维数不匹配,可能会导致问题。与KSOM相比,生长自组织神经网络(GSONN)可以在学习过程中改变其拓扑结构。GSONN和KSOM的拓扑形成都是由软竞争学习驱动的。本文首先介绍了KSOM和神经气体网络。然后,我们讨论了一些非固定维数的GSONN,如生长神经气体和作者的模型:孪生生长神经气体及其在模式分类中的应用。最后给出了一些结论
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Algorithms and Results in Content-Based Visual Query of the Image Databases Resulting from Dicom Files A New k-means Based Clustering Algorithm in Aspect Mining A Framework for Scheduling Image Processing Applications in MedioGRID HTML Pattern Generator--Automatic Data Extraction from Web Pages Incremental Deterministic Planning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1