信息视图中的f -并行约简

Lin Chen, Dayong Deng, Chunping Wang
{"title":"信息视图中的f -并行约简","authors":"Lin Chen, Dayong Deng, Chunping Wang","doi":"10.1109/CSO.2012.134","DOIUrl":null,"url":null,"abstract":"Parallel reducts in the information view and an algorithm with the matrix of attribute significance in the information view are introduced in this paper. Furthermore, F-attribute significance in the information view is defined, and its properties are investigated. We apply it to obtain parallel reducts, and an algorithm with F-attribute significance in the information view is proposed. Experiments show that our methods have advantages over dynamic reducts, and the new method not only improves the time efficiency but also decreases the length of parallel reducts.","PeriodicalId":170543,"journal":{"name":"2012 Fifth International Joint Conference on Computational Sciences and Optimization","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"F-Parallel Reducts in the Information View\",\"authors\":\"Lin Chen, Dayong Deng, Chunping Wang\",\"doi\":\"10.1109/CSO.2012.134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Parallel reducts in the information view and an algorithm with the matrix of attribute significance in the information view are introduced in this paper. Furthermore, F-attribute significance in the information view is defined, and its properties are investigated. We apply it to obtain parallel reducts, and an algorithm with F-attribute significance in the information view is proposed. Experiments show that our methods have advantages over dynamic reducts, and the new method not only improves the time efficiency but also decreases the length of parallel reducts.\",\"PeriodicalId\":170543,\"journal\":{\"name\":\"2012 Fifth International Joint Conference on Computational Sciences and Optimization\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fifth International Joint Conference on Computational Sciences and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2012.134\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fifth International Joint Conference on Computational Sciences and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2012.134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

介绍了信息视图中的并行约简和信息视图中属性重要性矩阵的算法。在此基础上,定义了f属性在信息视图中的重要性,并研究了f属性在信息视图中的重要性。将其应用于并行约简中,提出了一种信息视图中具有f属性显著性的算法。实验表明,该方法与动态约简相比具有优势,不仅提高了时间效率,而且缩短了并行约简的长度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
F-Parallel Reducts in the Information View
Parallel reducts in the information view and an algorithm with the matrix of attribute significance in the information view are introduced in this paper. Furthermore, F-attribute significance in the information view is defined, and its properties are investigated. We apply it to obtain parallel reducts, and an algorithm with F-attribute significance in the information view is proposed. Experiments show that our methods have advantages over dynamic reducts, and the new method not only improves the time efficiency but also decreases the length of parallel reducts.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信