Vahid Abrishami, G. T. Tabrizi, H. Deldari, Maryam Sabzevari
{"title":"基于模糊Hopfield网络的分区聚类","authors":"Vahid Abrishami, G. T. Tabrizi, H. Deldari, Maryam Sabzevari","doi":"10.1109/UKRICIS.2010.5898145","DOIUrl":null,"url":null,"abstract":"This paper proposes a new clustering algorithm which employs an improved stochastic competitive Hopfield network in order to organize data patterns into natural groups, or clusters, in an unsupervised manner. To overcome the problem of uncertainty for clustering, this Hopfield network employs a fuzzy based energy function. Additionally, a chaotic variable is introduced in order to escape from the local minima and gain a better clustering. By maximizing the degree of membership for each data item in a cluster using Hopfield network, we achieve a superior accuracy to that of the best existing algorithms such as optimal competitive Hopfield model, stochastic optimal competitive Hopfield network, k-means and genetic algorithm. The experimental results demonstrate the scalability and robustness of our algorithm over large datasets.","PeriodicalId":359942,"journal":{"name":"2010 IEEE 9th International Conference on Cyberntic Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A fuzzy based Hopfield network for partitional clustering\",\"authors\":\"Vahid Abrishami, G. T. Tabrizi, H. Deldari, Maryam Sabzevari\",\"doi\":\"10.1109/UKRICIS.2010.5898145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new clustering algorithm which employs an improved stochastic competitive Hopfield network in order to organize data patterns into natural groups, or clusters, in an unsupervised manner. To overcome the problem of uncertainty for clustering, this Hopfield network employs a fuzzy based energy function. Additionally, a chaotic variable is introduced in order to escape from the local minima and gain a better clustering. By maximizing the degree of membership for each data item in a cluster using Hopfield network, we achieve a superior accuracy to that of the best existing algorithms such as optimal competitive Hopfield model, stochastic optimal competitive Hopfield network, k-means and genetic algorithm. The experimental results demonstrate the scalability and robustness of our algorithm over large datasets.\",\"PeriodicalId\":359942,\"journal\":{\"name\":\"2010 IEEE 9th International Conference on Cyberntic Intelligent Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 9th International Conference on Cyberntic Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UKRICIS.2010.5898145\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 9th International Conference on Cyberntic Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UKRICIS.2010.5898145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A fuzzy based Hopfield network for partitional clustering
This paper proposes a new clustering algorithm which employs an improved stochastic competitive Hopfield network in order to organize data patterns into natural groups, or clusters, in an unsupervised manner. To overcome the problem of uncertainty for clustering, this Hopfield network employs a fuzzy based energy function. Additionally, a chaotic variable is introduced in order to escape from the local minima and gain a better clustering. By maximizing the degree of membership for each data item in a cluster using Hopfield network, we achieve a superior accuracy to that of the best existing algorithms such as optimal competitive Hopfield model, stochastic optimal competitive Hopfield network, k-means and genetic algorithm. The experimental results demonstrate the scalability and robustness of our algorithm over large datasets.