{"title":"区间2型模糊集广义质心的快速递归计算方法","authors":"M. Melgarejo","doi":"10.1109/NAFIPS.2007.383835","DOIUrl":null,"url":null,"abstract":"This article presents a recursive algorithm to compute the generalized centroid of an interval type-2 fuzzy set. First, a re-expression of the upper and lower limits of the generalized centroid is introduced. Then, the re-expressed formulas are solved by using a mixed approach of exhaustive search and recursive computations. This method is compared with the Karnik-Mendel iterative algorithm under the same computational principles. Experimental evidence shows that the recursive approach is computationally faster than the Karnik-Mendel method without loosing numeric precision.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"115","resultStr":"{\"title\":\"A Fast Recursive Method to Compute the Generalized Centroid of an Interval Type-2 Fuzzy Set\",\"authors\":\"M. Melgarejo\",\"doi\":\"10.1109/NAFIPS.2007.383835\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article presents a recursive algorithm to compute the generalized centroid of an interval type-2 fuzzy set. First, a re-expression of the upper and lower limits of the generalized centroid is introduced. Then, the re-expressed formulas are solved by using a mixed approach of exhaustive search and recursive computations. This method is compared with the Karnik-Mendel iterative algorithm under the same computational principles. Experimental evidence shows that the recursive approach is computationally faster than the Karnik-Mendel method without loosing numeric precision.\",\"PeriodicalId\":292853,\"journal\":{\"name\":\"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"115\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAFIPS.2007.383835\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAFIPS.2007.383835","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Fast Recursive Method to Compute the Generalized Centroid of an Interval Type-2 Fuzzy Set
This article presents a recursive algorithm to compute the generalized centroid of an interval type-2 fuzzy set. First, a re-expression of the upper and lower limits of the generalized centroid is introduced. Then, the re-expressed formulas are solved by using a mixed approach of exhaustive search and recursive computations. This method is compared with the Karnik-Mendel iterative algorithm under the same computational principles. Experimental evidence shows that the recursive approach is computationally faster than the Karnik-Mendel method without loosing numeric precision.