期刊文献+

改进的概念格属性约简算法 被引量:5

Improved algorithm for attribute reduction on concept lattice
下载PDF
导出
摘要 提出了一种改进的启发式算法,与已有启发式算法相比,能从搜索空间中逐次删除冗余属性,避免了对其重要性的重复计算,同时减少对非冗余属性重要性的计算,从而降低了时间复杂度。通过实例表明了该约简算法的可行性与有效性。 An improved heuristic algorithm is proposed.Compared with those existed heuristic algorithms,its flexibility has been increased because calculating the important value of unimportant attributes repeatedly can be avoided by removing unimportant attributes gradually from the search space.Futhermore,the improved heuristic algorithm reduces calculating the important value of attributes,it futher reduces the time complexity.Finally,an example is used to demonstrate both the feasibility and validity of the proposed algorithm.
出处 《计算机工程与应用》 CSCD 北大核心 2011年第8期146-148,共3页 Computer Engineering and Applications
基金 国家自然科学基金(No.70861001) 广西自然科学基金(No.0991027)~~
关键词 形式背景 概念格 属性约简 启发式算法 formal context concept lattice attribute reduction heuristic algorithm
  • 相关文献

参考文献8

  • 1Wille R.Restructuring lattice theory:An approach based on hier- archies of concepts[C]/fRival I.Ordered Sets.Dordrecht-Boston: Reidel, 1982: 445 -470.
  • 2Oosthulzen G D.The application of concept lattice to machine learning[R].South Africa:University of Pretoria, 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]//Har- rold M J, Visaggio G.Intemafional Confereenee on Software Maintenance, Bari, Italy.Washington D C: 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. 被引量:194
  • 7吴强,周文,刘宗田,陈慧琼.基于粗糙集理论的概念格属性约简及算法[J].计算机科学,2006,33(6):179-181. 被引量:10
  • 8吕跃进,李金海.概念格属性约简的启发式算法[J].计算机工程与应用,2009,45(2):154-157. 被引量:8

二级参考文献35

  • 1张文修,魏玲,祁建军.概念格的属性约简理论与方法[J].中国科学(E辑),2005,35(6):628-639. 被引量:194
  • 2吴强,周文,刘宗田,陈慧琼.基于粗糙集理论的概念格属性约简及算法[J].计算机科学,2006,33(6):179-181. 被引量:10
  • 3Wille R.Restructuring lattice theory:An approach based on hierarchies of concepts[C]//Rival I.Ordered Sets.Dordrecht-Boston:Reidel,1982:445-470.
  • 4Oosthulzen G D.The application of concept lattice to machine learning[R].University of Pretoria,South Africa,1996.
  • 5Oosthulzen G D.The application of concept lattice to machine learning[R].University of Pretoria,South Africa,1996.
  • 6Siff 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.
  • 7Schmitt I,Soake G.Merging inheritances for scheme integration based on concept lattices[EB/OL].hitp://www.Mathematic.tu-dram stadt.de/ags/agl.
  • 8Oosthuizen G D. The Application of Concept Lattice to Machine Learning. Technical Report, University of Pretoria, South Africa, 1996.
  • 9Ho 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.
  • 10Kent R E. Bowman C M. Digital Libraries, Conceptual Knowledge Systems and the Nebula Interface. Technical Report, University of Arkansas, 1995.

共引文献202

同被引文献71

引证文献5

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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