{"title":"基于判别的邻域粗糙集属性还原","authors":"Biqing Wang","doi":"10.26689/jera.v8i1.5937","DOIUrl":null,"url":null,"abstract":"For neighborhood rough set attribute reduction algorithms based on dependency degree, a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm using discernment as the heuristic information was proposed. The reduction algorithm comprehensively considers the dependency degree and neighborhood granulation degree of attributes, allowing for a more accurate measurement of the importance degrees of attributes. Example analyses and experimental results demonstrate the feasibility and effectiveness of the algorithm.","PeriodicalId":508251,"journal":{"name":"Journal of Electronic Research and Application","volume":"36 3-4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Attribute Reduction of Neighborhood Rough Set Based on Discernment\",\"authors\":\"Biqing Wang\",\"doi\":\"10.26689/jera.v8i1.5937\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For neighborhood rough set attribute reduction algorithms based on dependency degree, a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm using discernment as the heuristic information was proposed. The reduction algorithm comprehensively considers the dependency degree and neighborhood granulation degree of attributes, allowing for a more accurate measurement of the importance degrees of attributes. Example analyses and experimental results demonstrate the feasibility and effectiveness of the algorithm.\",\"PeriodicalId\":508251,\"journal\":{\"name\":\"Journal of Electronic Research and Application\",\"volume\":\"36 3-4\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Electronic Research and Application\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26689/jera.v8i1.5937\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Electronic Research and Application","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26689/jera.v8i1.5937","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Attribute Reduction of Neighborhood Rough Set Based on Discernment
For neighborhood rough set attribute reduction algorithms based on dependency degree, a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm using discernment as the heuristic information was proposed. The reduction algorithm comprehensively considers the dependency degree and neighborhood granulation degree of attributes, allowing for a more accurate measurement of the importance degrees of attributes. Example analyses and experimental results demonstrate the feasibility and effectiveness of the algorithm.