CASIA OpenIR  > 09年以前成果
Tree expressions for information systems
Zhao, Min; Han, Su-Qing; Wang, Jue
2007-03-01
发表期刊JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
卷号22期号:2页码:297-307
文章类型Article
摘要The discernibility matrix is one of the most important approaches to computing positive region, reduct, core and value reduct in rough sets. The subject of this paper is to develop a parallel approach of it, called "tree expression". Its computational complexity for positive region and reduct is O(m(2) x n) instead of O(m x n(2)) in discernibility-matrix-based approach, and is not over O(n(2)) for other concepts in rough sets, where m and n are the numbers of attributes and objects respectively in a given dataset (also called an "information system" in rough sets). This approach suits information systems with n >> m and containing over one million objects.
关键词Algorithms Tree Expression Reduct Theory
WOS标题词Science & Technology ; Technology
收录类别SCI
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Hardware & Architecture ; Computer Science, Software Engineering
WOS记录号WOS:000245374700016
引用统计
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/9462
专题09年以前成果
作者单位1.NEC Res China, Beijing 100080, Peoples R China
2.Taiyuan Normal Univ, Dept Math, Taiyuan 030012, Peoples R China
3.Chinese Acad Sci, Inst Automat, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Zhao, Min,Han, Su-Qing,Wang, Jue. Tree expressions for information systems[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2007,22(2):297-307.
APA Zhao, Min,Han, Su-Qing,&Wang, Jue.(2007).Tree expressions for information systems.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,22(2),297-307.
MLA Zhao, Min,et al."Tree expressions for information systems".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 22.2(2007):297-307.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhao, Min]的文章
[Han, Su-Qing]的文章
[Wang, Jue]的文章
百度学术
百度学术中相似的文章
[Zhao, Min]的文章
[Han, Su-Qing]的文章
[Wang, Jue]的文章
必应学术
必应学术中相似的文章
[Zhao, Min]的文章
[Han, Su-Qing]的文章
[Wang, Jue]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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