首页 | 本学科首页   官方微博 | 高级检索  
     

基于概念格的知识约简算法的实现
引用本文:王旭阳,李明. 基于概念格的知识约简算法的实现[J]. 科学技术与工程, 2009, 9(1)
作者姓名:王旭阳  李明
作者单位:兰州理工大学,计算机与通信学院,兰州,730050;兰州理工大学,计算机与通信学院,兰州,730050
摘    要:探讨了Rough集和概念格的基本理论,将Rough集和概念格模型有机地结合起来,运用Rough集的约简理论提出一种基于概念格的知识约简方法并通过实验进行了验证,结果表明利用Rough集理论对以形式背景形式描述的原始数据集进行约简,可以在一定程度上减小概念格的规模.

关 键 词:Rough集  形式背景  概念格  知识约简

Research of Knowledge Reduction Based on Concept Lattice
WANG Xu-yang,LI Ming. Research of Knowledge Reduction Based on Concept Lattice[J]. Science Technology and Engineering, 2009, 9(1)
Authors:WANG Xu-yang  LI Ming
Affiliation:College of Computer and Communication;Lanzhou University of Technology;Lanzhou 730050;P.R.China
Abstract:Inquiring into the basic theory of rough set and concept lattice,a method of knowledge is proposed reduction which combine rough set theory and concept lattice model.At last,experiment results are given.The result shows that reduct the original data set which described with formal context can minish the size of concept lattice at a certain extent.
Keywords:rough set formal context concept lattice knowledge reduction  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号