高维神经网络人工智能能够快速学习识别新的气味,并逐步扩大数据库

A. I. Ivanov, V. Kulagin, Y. M. Kuznetsov, G. M. Chulkova, A. Ivannikov
{"title":"高维神经网络人工智能能够快速学习识别新的气味,并逐步扩大数据库","authors":"A. I. Ivanov, V. Kulagin, Y. M. Kuznetsov, G. M. Chulkova, A. Ivannikov","doi":"10.1109/DIPDMWC.2016.7529413","DOIUrl":null,"url":null,"abstract":"We demonstrate that classical quadratic forms are not able to solve the problem of recognizing high-dimensional images. The “deep” Galushkin-Hinton neural networks can solve the problem of high-dimensional image recognition, but their training has exponential computational complexity. It is technically impossible to train and retrain a “deep” neural network rapidly. For mobile “artificial nose” systems we proposed to employ a number of “wide” neural networks trained in accordance with (GOST R 52633.5-2011). This standardized learning algorithm has a linear computational complexity, i.e. for each new smell image a time of about 0.3 seconds is sufficient for creating and training a new neural network with 2024 inputs and 256 outputs. This leads to the possibility of the rapid training of the artificial intelligence “artificial nose” and a gradual expansion of its database consisting of 10 000 or more trained artificial neural networks.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"High-dimensional neural-network artificial intelligence capable of quick learning to recognize a new smell, and gradually expanding the database\",\"authors\":\"A. I. Ivanov, V. Kulagin, Y. M. Kuznetsov, G. M. Chulkova, A. Ivannikov\",\"doi\":\"10.1109/DIPDMWC.2016.7529413\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We demonstrate that classical quadratic forms are not able to solve the problem of recognizing high-dimensional images. The “deep” Galushkin-Hinton neural networks can solve the problem of high-dimensional image recognition, but their training has exponential computational complexity. It is technically impossible to train and retrain a “deep” neural network rapidly. For mobile “artificial nose” systems we proposed to employ a number of “wide” neural networks trained in accordance with (GOST R 52633.5-2011). This standardized learning algorithm has a linear computational complexity, i.e. for each new smell image a time of about 0.3 seconds is sufficient for creating and training a new neural network with 2024 inputs and 256 outputs. This leads to the possibility of the rapid training of the artificial intelligence “artificial nose” and a gradual expansion of its database consisting of 10 000 or more trained artificial neural networks.\",\"PeriodicalId\":298218,\"journal\":{\"name\":\"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DIPDMWC.2016.7529413\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DIPDMWC.2016.7529413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

我们证明了经典的二次型不能解决高维图像的识别问题。“深度”Galushkin-Hinton神经网络可以解决高维图像识别问题,但其训练具有指数级的计算复杂度。从技术上讲,快速训练和再训练一个“深度”神经网络是不可能的。对于移动“人造鼻子”系统,我们建议采用许多根据(GOST R 52633.5-2011)训练的“宽”神经网络。这种标准化的学习算法具有线性计算复杂度,即对于每个新的气味图像,大约0.3秒的时间足以创建和训练一个具有2024个输入和256个输出的新神经网络。这使得人工智能“人工鼻子”的快速训练成为可能,并逐渐扩大其由10000个或更多训练过的人工神经网络组成的数据库。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
High-dimensional neural-network artificial intelligence capable of quick learning to recognize a new smell, and gradually expanding the database
We demonstrate that classical quadratic forms are not able to solve the problem of recognizing high-dimensional images. The “deep” Galushkin-Hinton neural networks can solve the problem of high-dimensional image recognition, but their training has exponential computational complexity. It is technically impossible to train and retrain a “deep” neural network rapidly. For mobile “artificial nose” systems we proposed to employ a number of “wide” neural networks trained in accordance with (GOST R 52633.5-2011). This standardized learning algorithm has a linear computational complexity, i.e. for each new smell image a time of about 0.3 seconds is sufficient for creating and training a new neural network with 2024 inputs and 256 outputs. This leads to the possibility of the rapid training of the artificial intelligence “artificial nose” and a gradual expansion of its database consisting of 10 000 or more trained artificial neural networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信