{"title":"利用部分定义的功能神经网络的常规特征求解","authors":"V. N. Betin, V. F. Ivashchenko, A. P. Suprun","doi":"10.3103/S0005105524700067","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we propose techniques to improve the efficiency of systems acting with knowledge bases and based on functional neural networks (FN-networks) formalism due to the use of their structural features. The article addresses the case of partially defined FN-networks, which have a regular structure and are set as lists of multiple similar objects and fragments with common structure such that their number is unknown and may be unlimited. It offers an algorithm to find solution, which is based on dynamic formation of limited, fully determined local fragments of partially defined network and subsequent transfer of the results to the entire FN-network, which may be endless<i>.</i></p>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Usage of Regular Features of Partially Defined Functional Neural Networks to Find a Solution\",\"authors\":\"V. N. Betin, V. F. Ivashchenko, A. P. Suprun\",\"doi\":\"10.3103/S0005105524700067\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we propose techniques to improve the efficiency of systems acting with knowledge bases and based on functional neural networks (FN-networks) formalism due to the use of their structural features. The article addresses the case of partially defined FN-networks, which have a regular structure and are set as lists of multiple similar objects and fragments with common structure such that their number is unknown and may be unlimited. It offers an algorithm to find solution, which is based on dynamic formation of limited, fully determined local fragments of partially defined network and subsequent transfer of the results to the entire FN-network, which may be endless<i>.</i></p>\",\"PeriodicalId\":42995,\"journal\":{\"name\":\"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.3103/S0005105524700067\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0005105524700067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Usage of Regular Features of Partially Defined Functional Neural Networks to Find a Solution
In this paper, we propose techniques to improve the efficiency of systems acting with knowledge bases and based on functional neural networks (FN-networks) formalism due to the use of their structural features. The article addresses the case of partially defined FN-networks, which have a regular structure and are set as lists of multiple similar objects and fragments with common structure such that their number is unknown and may be unlimited. It offers an algorithm to find solution, which is based on dynamic formation of limited, fully determined local fragments of partially defined network and subsequent transfer of the results to the entire FN-network, which may be endless.
期刊介绍:
Automatic Documentation and Mathematical Linguistics is an international peer reviewed journal that covers all aspects of automation of information processes and systems, as well as algorithms and methods for automatic language analysis. Emphasis is on the practical applications of new technologies and techniques for information analysis and processing.