{"title":"基于联想记忆方法的模式识别算法分析——Hopfield网络与分布式分层图神经元(DHGN)的比较研究","authors":"A. Amin, R. Mahmood, A.I. Khan","doi":"10.1109/CIT.2008.WORKSHOPS.65","DOIUrl":null,"url":null,"abstract":"In this paper, we conduct a comparative analysis of two associative memory-based pattern recognition algorithms. We compare the established Hopfield network algorithm with our novel Distributed Hierarchical Graph Neuron (DHGN) algorithm. The computational complexity and recall efficiency aspects of these algorithms are discussed. The results show that DHGN offers lower computational complexity with better recall efficiency compared to the Hopfield network.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"135 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Analysis of Pattern Recognition Algorithms Using Associative Memory Approach: A Comparative Study between the Hopfield Network and Distributed Hierarchical Graph Neuron (DHGN)\",\"authors\":\"A. Amin, R. Mahmood, A.I. Khan\",\"doi\":\"10.1109/CIT.2008.WORKSHOPS.65\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we conduct a comparative analysis of two associative memory-based pattern recognition algorithms. We compare the established Hopfield network algorithm with our novel Distributed Hierarchical Graph Neuron (DHGN) algorithm. The computational complexity and recall efficiency aspects of these algorithms are discussed. The results show that DHGN offers lower computational complexity with better recall efficiency compared to the Hopfield network.\",\"PeriodicalId\":155998,\"journal\":{\"name\":\"2008 IEEE 8th International Conference on Computer and Information Technology Workshops\",\"volume\":\"135 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 8th International Conference on Computer and Information Technology Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIT.2008.WORKSHOPS.65\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of Pattern Recognition Algorithms Using Associative Memory Approach: A Comparative Study between the Hopfield Network and Distributed Hierarchical Graph Neuron (DHGN)
In this paper, we conduct a comparative analysis of two associative memory-based pattern recognition algorithms. We compare the established Hopfield network algorithm with our novel Distributed Hierarchical Graph Neuron (DHGN) algorithm. The computational complexity and recall efficiency aspects of these algorithms are discussed. The results show that DHGN offers lower computational complexity with better recall efficiency compared to the Hopfield network.