CASIA OpenIR  > 09年以前成果
On reduct construction algorithms
Yao, Yiyu; Zhao, Yan; Wang, Jue; Wang, G; Peters, JF; Skowron, YY; Yao, YY
2006
发表期刊ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS
卷号4062页码:297-304
文章类型Article
摘要This paper critically analyzes reduct construction methods at two levels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic groups based on the underlying control structures. At a low level, by adopting different heuristics or fitness functions for attribute selection, one is able to derive most of the existing algorithms. The analysis brings new insights into the problem of reduct construction, and provides guidelines for the design of new algorithms.
关键词Reduct Construction Algorithms Deletion Strategy Addition-deletion Strategy Addition Strategy Attribute Selection Heuristics
WOS标题词Science & Technology ; Technology
关键词[WOS]RELATIONAL DATABASES ; ATTRIBUTES
收录类别ISTP ; SCI
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Artificial Intelligence
WOS记录号WOS:000239623500043
引用统计
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/9316
专题09年以前成果
作者单位1.Univ Regina, Dept Comp Sci, Regina, SK S4S 0A2, Canada
2.Chinese Acad Sci, Inst Automat, Lab Complex Syst & Intelligence Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Yao, Yiyu,Zhao, Yan,Wang, Jue,et al. On reduct construction algorithms[J]. ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS,2006,4062:297-304.
APA Yao, Yiyu.,Zhao, Yan.,Wang, Jue.,Wang, G.,Peters, JF.,...&Yao, YY.(2006).On reduct construction algorithms.ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS,4062,297-304.
MLA Yao, Yiyu,et al."On reduct construction algorithms".ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS 4062(2006):297-304.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Yao, Yiyu]的文章
[Zhao, Yan]的文章
[Wang, Jue]的文章
百度学术
百度学术中相似的文章
[Yao, Yiyu]的文章
[Zhao, Yan]的文章
[Wang, Jue]的文章
必应学术
必应学术中相似的文章
[Yao, Yiyu]的文章
[Zhao, Yan]的文章
[Wang, Jue]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。