初始化PRSOM架构的预处理阶段

Harchli Fidae, En-naimani Zakariae, Es-Safi Abdelatif, Ettaouil Mohamed
{"title":"初始化PRSOM架构的预处理阶段","authors":"Harchli Fidae, En-naimani Zakariae, Es-Safi Abdelatif, Ettaouil Mohamed","doi":"10.1109/ISACV.2015.7106190","DOIUrl":null,"url":null,"abstract":"The self-organizing map (SOM) is a popular neural network which was designed for solving problems that involve tasks such as clustering and visualization. Specially, It provides a new strategy of clustering using a competition and co-operation principal. The probabilistic Kohonen network (PRSOM) is the stochastic version of classical one. However, determination of the optimal number of neurons and their initial weight vectors in the map is still a big problem in the literature. These parameters have a great impact on the learning process of the network, the convergence and the quality of results. Also determination of clusters' number of datasets is a very difficult task. In this paper we extend the original Kohonen network to classify unlabeled data and determine the number of clusters. The task consists of generating a heuristic method before the learning phase of the network. The main goal of this method is looking for the initial parameters of the map. We compare the result of the proposed method with that of the original Kohonen network. We further experiment the applicability and the performance of the method on dataset Iris. The result shows that the proposed method is able to produce satisfactory clustering results.","PeriodicalId":426557,"journal":{"name":"2015 Intelligent Systems and Computer Vision (ISCV)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Preprocessing phase for initializing the PRSOM architecture\",\"authors\":\"Harchli Fidae, En-naimani Zakariae, Es-Safi Abdelatif, Ettaouil Mohamed\",\"doi\":\"10.1109/ISACV.2015.7106190\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The self-organizing map (SOM) is a popular neural network which was designed for solving problems that involve tasks such as clustering and visualization. Specially, It provides a new strategy of clustering using a competition and co-operation principal. The probabilistic Kohonen network (PRSOM) is the stochastic version of classical one. However, determination of the optimal number of neurons and their initial weight vectors in the map is still a big problem in the literature. These parameters have a great impact on the learning process of the network, the convergence and the quality of results. Also determination of clusters' number of datasets is a very difficult task. In this paper we extend the original Kohonen network to classify unlabeled data and determine the number of clusters. The task consists of generating a heuristic method before the learning phase of the network. The main goal of this method is looking for the initial parameters of the map. We compare the result of the proposed method with that of the original Kohonen network. We further experiment the applicability and the performance of the method on dataset Iris. The result shows that the proposed method is able to produce satisfactory clustering results.\",\"PeriodicalId\":426557,\"journal\":{\"name\":\"2015 Intelligent Systems and Computer Vision (ISCV)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Intelligent Systems and Computer Vision (ISCV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISACV.2015.7106190\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Intelligent Systems and Computer Vision (ISCV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISACV.2015.7106190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

自组织映射(SOM)是一种流行的神经网络,其设计用于解决涉及聚类和可视化等任务的问题。特别提出了一种基于竞争合作原则的聚类策略。概率Kohonen网络(PRSOM)是经典网络的随机版本。然而,确定最优神经元数量及其初始权重向量在图中仍然是一个大问题。这些参数对网络的学习过程、收敛性和结果的质量有很大的影响。此外,确定集群的数据集数量也是一项非常困难的任务。本文扩展了原始Kohonen网络,用于对未标记数据进行分类并确定聚类数量。该任务包括在网络学习阶段之前生成启发式方法。该方法的主要目标是寻找地图的初始参数。我们将该方法的结果与原始Kohonen网络的结果进行了比较。进一步在数据集Iris上验证了该方法的适用性和性能。结果表明,该方法能够产生令人满意的聚类结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Preprocessing phase for initializing the PRSOM architecture
The self-organizing map (SOM) is a popular neural network which was designed for solving problems that involve tasks such as clustering and visualization. Specially, It provides a new strategy of clustering using a competition and co-operation principal. The probabilistic Kohonen network (PRSOM) is the stochastic version of classical one. However, determination of the optimal number of neurons and their initial weight vectors in the map is still a big problem in the literature. These parameters have a great impact on the learning process of the network, the convergence and the quality of results. Also determination of clusters' number of datasets is a very difficult task. In this paper we extend the original Kohonen network to classify unlabeled data and determine the number of clusters. The task consists of generating a heuristic method before the learning phase of the network. The main goal of this method is looking for the initial parameters of the map. We compare the result of the proposed method with that of the original Kohonen network. We further experiment the applicability and the performance of the method on dataset Iris. The result shows that the proposed method is able to produce satisfactory clustering results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信