计算动态约简的研究

Jia-yang Wang, L. Deng, Chen Zhang
{"title":"计算动态约简的研究","authors":"Jia-yang Wang, L. Deng, Chen Zhang","doi":"10.1109/GrC.2012.6468592","DOIUrl":null,"url":null,"abstract":"The mass dataset based on static reduct concludes large instability. A new thought is provided by dynamic reduct. The thought of dynamic reduct is described, its subtable extracting problem is analyzed in detail, and the shortage is pointed out. A new algorithm is given to calculate the size of the dynamic reduct subtable family, and some parameters are also presented to evaluate the dynamic reduct sampling family.","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The research on computing dynamic reduct\",\"authors\":\"Jia-yang Wang, L. Deng, Chen Zhang\",\"doi\":\"10.1109/GrC.2012.6468592\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The mass dataset based on static reduct concludes large instability. A new thought is provided by dynamic reduct. The thought of dynamic reduct is described, its subtable extracting problem is analyzed in detail, and the shortage is pointed out. A new algorithm is given to calculate the size of the dynamic reduct subtable family, and some parameters are also presented to evaluate the dynamic reduct sampling family.\",\"PeriodicalId\":126161,\"journal\":{\"name\":\"IEEE International Conference on Granular Computing\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Granular Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GrC.2012.6468592\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Granular Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GrC.2012.6468592","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

基于静态约简的海量数据集具有较大的不稳定性。动态约简提供了一种新的思路。描述了动态约简的思想,详细分析了其子表提取问题,指出了其不足之处。给出了一种计算动态约简子表族大小的新算法,并给出了评估动态约简抽样族的一些参数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The research on computing dynamic reduct
The mass dataset based on static reduct concludes large instability. A new thought is provided by dynamic reduct. The thought of dynamic reduct is described, its subtable extracting problem is analyzed in detail, and the shortage is pointed out. A new algorithm is given to calculate the size of the dynamic reduct subtable family, and some parameters are also presented to evaluate the dynamic reduct sampling family.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An updated algorithm for fast computing positive region A new classification algorithm based on ensemble PSO_SVM and clustering analysis Rough set over dual-universes in general incomplete information system The research on computing dynamic reduct Qualitative mapping defined wavelet transformation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1