{"title":"一种计算相对核和约简的有效实现","authors":"R. Bautista, M. Millán, J.F. Diaz","doi":"10.1109/NAFIPS.1999.781802","DOIUrl":null,"url":null,"abstract":"Knowledge reduction is an important issue when dealing with huge amounts of data. Rough set theory offers two fundamental concepts to deal with this particular problem: reduct and core. These concepts are generalized to families of equivalence relations. We propose a method of implementation to calculate relative core and reducts based on the positive region of a classification with respect to another classification. We use families of equivalence relations instead of classifications.","PeriodicalId":335957,"journal":{"name":"18th International Conference of the North American Fuzzy Information Processing Society - NAFIPS (Cat. No.99TH8397)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An efficient implementation to calculate relative core and reducts\",\"authors\":\"R. Bautista, M. Millán, J.F. Diaz\",\"doi\":\"10.1109/NAFIPS.1999.781802\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Knowledge reduction is an important issue when dealing with huge amounts of data. Rough set theory offers two fundamental concepts to deal with this particular problem: reduct and core. These concepts are generalized to families of equivalence relations. We propose a method of implementation to calculate relative core and reducts based on the positive region of a classification with respect to another classification. We use families of equivalence relations instead of classifications.\",\"PeriodicalId\":335957,\"journal\":{\"name\":\"18th International Conference of the North American Fuzzy Information Processing Society - NAFIPS (Cat. No.99TH8397)\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"18th International Conference of the North American Fuzzy Information Processing Society - NAFIPS (Cat. No.99TH8397)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAFIPS.1999.781802\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th International Conference of the North American Fuzzy Information Processing Society - NAFIPS (Cat. No.99TH8397)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAFIPS.1999.781802","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient implementation to calculate relative core and reducts
Knowledge reduction is an important issue when dealing with huge amounts of data. Rough set theory offers two fundamental concepts to deal with this particular problem: reduct and core. These concepts are generalized to families of equivalence relations. We propose a method of implementation to calculate relative core and reducts based on the positive region of a classification with respect to another classification. We use families of equivalence relations instead of classifications.