期刊文献+

基于概念格外延信息量的属性约简算法 被引量:9

Algorithm for attribute reduction based on information quantity of concept lattice extension
在线阅读 下载PDF
导出
摘要 概念格是知识处理与分析的一个有力的工具,在知识约简和数据挖掘方面有着重要的利用。首先给出了概念格外延信息量的概念,在此基础上研究了合理刻画属性重要性的指标,并给出了概念格核心属性的判定定理,然后以这些指标作为启发式信息设计了一种新颖的概念格启发式属性约简算法,最后通过实例表明了该约简算法的可行性与有效性。 The concept lattice is useful in knowledge processing and analying.And it has been used with a high intensity to knowledge reduction and data mining.This paper first puts forward information quantity of concept lattice extension,then studies new and relatively reasonable formulas measuring attribute significance and proposes a theory for justifying whether an attribute is a key attribute on concept lattice or not.And then those formulas are used as heuristic information to design a novel and heuristic algorithm for attribute reduction on concept lattice.Finally,a real example is used to demonstrate both its feasibility and effectiveness.
出处 《计算机工程与应用》 CSCD 北大核心 2009年第10期144-146,150,共4页 Computer Engineering and Applications
基金 国家自然科学基金No.70861001 广西研究生科研创新项目No.2008105930701M51~~
关键词 形式背景 概念格 信息量 属性约简 formal context concept lattice information quantity attribute reduction
  • 相关文献

参考文献7

  • 1Wille R.Restructuring lattice theory:An approach based on hierarchies of concepts[C]//Rival I.Ordered Sets.Dordrecht-Boston:Reidel, 1982 : 445-470.
  • 2Oosthulzen G D.The application of concept lattice to machine learning[R].University of Pretoria,South Africa,1996.
  • 3Ho T B.Incremental conceptual clustering in the framework of Galois lattice[C]//Lu H, Motoda H, Liu H.KDD : Techniques and Applications.Singapore:World Scientific, 1997:49-64.
  • 4Sift M,Reps T.Identifying modules via concept analysis[C]//Harrold M J,Visaggio G.Intemational Confercence on Software Maintenance. Bari,Italy,Washington,DC:IEEE Computer Society ,1997 :170-179.
  • 5Schmitt I,Saake G.Merging inheritances for scheme integration based on concept lattices[EB/OL].http://www.Mathematic.tu-dram stadt.de/ags/agl.
  • 6张文修,魏玲,祁建军.概念格的属性约简理论与方法[J].中国科学(E辑),2005,35(6):628-639. 被引量:196
  • 7李立峰,王国俊.一种求概念格属性约简的方法[J].计算机工程与应用,2006,42(20):147-149. 被引量:13

二级参考文献24

  • 1张文修,魏玲,祁建军.概念格的属性约简理论与方法[J].中国科学(E辑),2005,35(6):628-639. 被引量:196
  • 2Wille R.Restructuring lattice theory:an approach based on hierarchies of concept[C].In:R Ivan Rival ed.Ordered Sets,Reidel,Dordeche,Boston,1982:445~470
  • 3Ho T B.Incremental Conceptual clustering in the framework of galois lattice[C].In:Lu H,Motoda H,Ziu H eds.KDD:Techniques and Applications,Word Scientific,1997:49~64
  • 4Kent R F,Bowman C M.Digital Libraries,Conceptual knowledge systems and the Nebula interface[R].Technical Report,University of Arkansan,1995
  • 5Huaiguo F,Engelbert M N.A Parallel Algorithm to Generate Formal concept for large Data[C].In:Second International Conference on Formal Concept Analysis(ICFCA2004),Sydney,2004:394~401
  • 6Mineau G W,Godin R.Automatic structuring of knowledge bases by conceptual clustering[J].IEEE Trans Knowledge Data Eng,1995 ;7(5):824~829
  • 7Oosthuizen G D. The Application of Concept Lattice to Machine Learning. Technical Report, University of Pretoria, South Africa, 1996.
  • 8Ho T B. Incremental conceptual clustering in the framework of Galois lattice. In: Lu H, Motoda H, Liu H, eds. KDD: Techniques and Applications. Singapore: World Scientific, 1997. 49~64.
  • 9Kent R E. Bowman C M. Digital Libraries, Conceptual Knowledge Systems and the Nebula Interface. Technical Report, University of Arkansas, 1995.
  • 10Corbett D, Burrow A L. Knowledge reuse in SEED exploiting conceptual graphs. In: International Conference on Conceptual Graphs (ICCS'96). Sydney, 1996. University of New South Wales, 1996. 56~60.

共引文献198

同被引文献22

引证文献9

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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