期刊文献+

基于概念格的知识约简算法的实现

Research of Knowledge Reduction Based on Concept Lattice
下载PDF
导出
摘要 探讨了Rough集和概念格的基本理论,将Rough集和概念格模型有机地结合起来,运用Rough集的约简理论提出一种基于概念格的知识约简方法并通过实验进行了验证,结果表明利用Rough集理论对以形式背景形式描述的原始数据集进行约简,可以在一定程度上减小概念格的规模。 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 reduet the original data set which described with formal context can minish the size of concept lattice at a certain extent.
作者 王旭阳 李明
出处 《科学技术与工程》 2009年第1期127-130,共4页 Science Technology and Engineering
关键词 ROUGH集 形式背景 概念格 知识约简 rough set formal context concept lattice knowledge reduction
  • 相关文献

参考文献4

二级参考文献31

  • 1曾黄麟.粗糙集理论及其应用[M].重庆:重庆大学出版社,1998..
  • 2PAWLAK Z.Rough Sets[J].International Journal of Computer Information Science,1982,11 (5):341-356.
  • 3PAWLAK Z,GRZYMALA-BUSSE J,SLOWINSKI R,et al.Rough Sets[J].Communications of the ACM,1995,38(11).
  • 4Ganter B,Wille R.Formal Concept Analysis,Mathematical Fou-ndations[M].Berlin,Germany:Springer-Verlag,1999.
  • 5Kent R E.Rough Concept Analysis:A Synthesis of Rough Sets and Formal Concept Analysis[J].Fundamenta Informaticae,1996,(27):169-181.
  • 6Pagliani P.From Concept Lattices to Approximation Spaces:Algebraic Structures of Some Spaces of Partial Objects[J].Fundamental Information,1993,(18):1-18.
  • 7Pawlak Z.Rough Set:Theoretical Aspects of Reasoning About Data[M].Boston:Kluwer Academic Publishers,1991.
  • 8Pawlak Z. Rough Sets: Theoretical Aspects of Reasoning about Data[M]. [s.l.] : Kluwer Academic Publishers, 1991.
  • 9Quinlan J R. Induction of decision tree[J]. Machine Learning,1986,1(1):81 - 106.
  • 10赵明 王秀峰 刘明吉.基于粗糙集理论的特征提取新算法[J].计算机科学,2001,28(5):125-127.

共引文献214

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部