一种计算相对核和约简的有效实现

R. Bautista, M. Millán, J.F. Diaz
{"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}
引用次数: 3

摘要

在处理大量数据时,知识约简是一个重要的问题。粗糙集理论提供了两个基本概念来处理这个特殊的问题:约简和核心。这些概念被推广到等价关系族。我们提出了一种基于一个分类相对于另一个分类的正区域来计算相对核心和约简的实现方法。我们使用等价关系族代替分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信