Wen Zhou, Zongtian Liu, Yan Zhao, Yu Zheng, Dong Xu, W. Liu, Ying Zhu
{"title":"基于模糊概念格的分类器","authors":"Wen Zhou, Zongtian Liu, Yan Zhao, Yu Zheng, Dong Xu, W. Liu, Ying Zhu","doi":"10.1109/FSKD.2007.322","DOIUrl":null,"url":null,"abstract":"The large collection of formal concepts can be a hedge of the application of FCA. Development of methods which help to overcome the problem of the huge size of concept lattice is thus an important task. This paper proposes clustering-based reduction algorithm for reducing the size of fuzzy concept lattices. At the end, experiment results show that the compression rate of the concept lattice and classifier is remarkable, while it preserves the accuracy of classification of concept lattice.","PeriodicalId":201883,"journal":{"name":"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)","volume":"13 1-2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fuzzy Concept Lattice Based Classifier\",\"authors\":\"Wen Zhou, Zongtian Liu, Yan Zhao, Yu Zheng, Dong Xu, W. Liu, Ying Zhu\",\"doi\":\"10.1109/FSKD.2007.322\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The large collection of formal concepts can be a hedge of the application of FCA. Development of methods which help to overcome the problem of the huge size of concept lattice is thus an important task. This paper proposes clustering-based reduction algorithm for reducing the size of fuzzy concept lattices. At the end, experiment results show that the compression rate of the concept lattice and classifier is remarkable, while it preserves the accuracy of classification of concept lattice.\",\"PeriodicalId\":201883,\"journal\":{\"name\":\"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)\",\"volume\":\"13 1-2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FSKD.2007.322\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2007.322","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The large collection of formal concepts can be a hedge of the application of FCA. Development of methods which help to overcome the problem of the huge size of concept lattice is thus an important task. This paper proposes clustering-based reduction algorithm for reducing the size of fuzzy concept lattices. At the end, experiment results show that the compression rate of the concept lattice and classifier is remarkable, while it preserves the accuracy of classification of concept lattice.