New neural networks for determining proximity and distance functions when comparing binary objects

V. Dmitrienko, A. Zakovorotniy, S. Leonov
{"title":"New neural networks for determining proximity and distance functions when comparing binary objects","authors":"V. Dmitrienko, A. Zakovorotniy, S. Leonov","doi":"10.1109/KhPIWeek57572.2022.9916368","DOIUrl":null,"url":null,"abstract":"Artificial neural networks are effectively used to solve various problems (recognition, clustering, classification, etc.) in conditions where information about objects is given by vectors with binary components. The Hamming neural network is an effective tool for solving these problems when the initial information is given in the form of bipolar vectors. However, when comparing binary objects with qualitative features, more than 70 different distances (proximity measures) and proximity functions of binary objects are used. Synthesizing dozens of neural networks for matching binary objects is too laborious. Therefore, a universal approach to the synthesis of such neural networks is proposed. In addition, the Hamming network can select only one object from its memory that is closest to the input. It cannot function normally if there are two or more such objects. The proposed neural network does not have this shortcoming. And last but not least, a neural network with this architecture allows you to calculate various distances and similarity measures of the input data and data stored in the network memory","PeriodicalId":197096,"journal":{"name":"2022 IEEE 3rd KhPI Week on Advanced Technology (KhPIWeek)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 3rd KhPI Week on Advanced Technology (KhPIWeek)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KhPIWeek57572.2022.9916368","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Artificial neural networks are effectively used to solve various problems (recognition, clustering, classification, etc.) in conditions where information about objects is given by vectors with binary components. The Hamming neural network is an effective tool for solving these problems when the initial information is given in the form of bipolar vectors. However, when comparing binary objects with qualitative features, more than 70 different distances (proximity measures) and proximity functions of binary objects are used. Synthesizing dozens of neural networks for matching binary objects is too laborious. Therefore, a universal approach to the synthesis of such neural networks is proposed. In addition, the Hamming network can select only one object from its memory that is closest to the input. It cannot function normally if there are two or more such objects. The proposed neural network does not have this shortcoming. And last but not least, a neural network with this architecture allows you to calculate various distances and similarity measures of the input data and data stored in the network memory
在比较二元物体时确定接近和距离函数的新神经网络
人工神经网络被有效地用于解决物体信息由二元分量向量给出的各种问题(识别、聚类、分类等)。当初始信息以双极向量的形式给出时,Hamming神经网络是解决这类问题的有效工具。然而,在将二元物体与定性特征进行比较时,使用了70多种不同的距离(接近度量)和接近函数。综合几十个神经网络来匹配二进制对象是非常费力的。因此,本文提出了一种通用的神经网络综合方法。此外,汉明网络只能从内存中选择一个最接近输入的对象。如果有两个或两个以上这样的物体,它就不能正常工作。所提出的神经网络没有这个缺点。最后但并非最不重要的是,具有这种架构的神经网络允许您计算输入数据和存储在网络存储器中的数据的各种距离和相似性度量
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信