{"title":"具有容差数据的熵正则化模糊c线","authors":"Y. Kanzawa, Y. Endo, S. Miyamoto","doi":"10.1109/FUZZY.2009.5277176","DOIUrl":null,"url":null,"abstract":"This paper presents a new clustering algorithm, which is based on entropy regularized fuzzy c-lines, can treat data with some errors. First, the tolerance is formulated and introduce into optimization problem of clustering. Next, the problem is solved using Karush-Kuhn-Tucker conditions. Last, the algorithm is constructed based on the results of solving the problem. Some numerical examples for the proposed method are shown.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Entropy regularized fuzzy C-lines for data with tolerance\",\"authors\":\"Y. Kanzawa, Y. Endo, S. Miyamoto\",\"doi\":\"10.1109/FUZZY.2009.5277176\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new clustering algorithm, which is based on entropy regularized fuzzy c-lines, can treat data with some errors. First, the tolerance is formulated and introduce into optimization problem of clustering. Next, the problem is solved using Karush-Kuhn-Tucker conditions. Last, the algorithm is constructed based on the results of solving the problem. Some numerical examples for the proposed method are shown.\",\"PeriodicalId\":117895,\"journal\":{\"name\":\"2009 IEEE International Conference on Fuzzy Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Fuzzy Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FUZZY.2009.5277176\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Fuzzy Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FUZZY.2009.5277176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Entropy regularized fuzzy C-lines for data with tolerance
This paper presents a new clustering algorithm, which is based on entropy regularized fuzzy c-lines, can treat data with some errors. First, the tolerance is formulated and introduce into optimization problem of clustering. Next, the problem is solved using Karush-Kuhn-Tucker conditions. Last, the algorithm is constructed based on the results of solving the problem. Some numerical examples for the proposed method are shown.