期刊文献+

一种渐进式概念格生成算法的优化

Optimization of an Incremental Concept Lattice Formation Algorithm
下载PDF
导出
摘要 形式概念分析是德国的数学家Wille于1982年提出的,其核心数据结构概念格接近于自然语言,易于理解,在数据挖掘领域有巨大的潜在应用价值。构建概念格在概念格应用中有举足轻重的地位。建格算法分为两种:批处理算法和渐进式算法。着重研究渐进式算法,并介绍一种渐进式算法的优化算法,这种优化算法在一定程度上提高了原算法的运行速度。 Building the concept lattice plays an important role in the application of the concept lattice.There are two typs of building concept lattice algorithm:batch algorithms and incremental algorithms.This paper focuses on the incremental algorithms,which has a better development,and introduces optimization algorithm of an incremental algorithm.The optimization algorithm,to some extent,improves the speed of the original algorithm.
出处 《工业控制计算机》 2012年第8期106-107,109,共3页 Industrial Control Computer
关键词 概念格 形式概念分析 渐进式算法 concept lattice formal concept analysis incremental algorithm
  • 相关文献

参考文献7

  • 1Will e R. Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival I eds. Ordered Set s, Dordrecht: Reidel , 1982. 445-470.
  • 2Ganter B,Wille R.Applied Lattice Theory:Formal Concept Analysis [EB/OL]. http://citeseerx.ist.psu.edu/viewdoc/down load?doi= 10.1.1.42.9907&rep=repl& type=pdf. 1997/2012-4-19.
  • 3毕强,滕广青.国外形式概念分析与概念格理论应用研究的前沿进展及热点分析[J].现代图书情报技术,2010(11):17-23. 被引量:27
  • 4陈锦坤,李进金.概念格的公理化[J].计算机工程与应用,2012,48(5):41-43. 被引量:5
  • 5Godin R.Incremental concept formation algorithmbased on Galois (concept) lattices [J].Compu tat ional Intelligence, 1995, 11(2):246-267.
  • 6谢志鹏,刘宗田.概念格的快速渐进式构造算法[J].计算机学报,2002,25(5):490-496. 被引量:120
  • 7Priss U. Formal Concept Analysis in Information Science. In: Blaise C,editor.Annual Review of Information Science and Technology. Information Today, Inc.; Medford, NJ: 2006.

二级参考文献60

  • 1张文修,魏玲,祁建军.概念格的属性约简理论与方法[J].中国科学(E辑),2005,35(6):628-639. 被引量:195
  • 2仇国芳,陈劲.概念知识系统与概念信息粒格[J].工程数学学报,2005,22(6):963-969. 被引量:13
  • 3王虹,张文修.基于概念格的形式背景的知识约简[J].模式识别与人工智能,2005,18(6):641-645. 被引量:4
  • 4Tonella P. Using a Concept Lattice of Decomposition Slices for Program Understanding and Impact Analysis [ J ]. IEEE Transactions on Software Engineering, 2003, 29 ( 6 ) :495 - 509.
  • 5Fabbrini F, Fusani M, Gnesi S, et al. Controlling Requirements Evolution: A Formal Concept Analysis -based Approach [ EB/ OL]. [2010 - 10 -29]. http://www - vs. infonnatik, uni - ulm. de/de/intra/bib/2007/ICSEA07/data/068 % 20Controlling% 20Re quirements% 20Evolution. pdf.
  • 6Stumme G, Wille R, Witle U. Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods [ EB/OL ]. [ 2010 - 10 - 12 ]. http ://citeseerx. ist. psu. edu/viewdoc/download? doi = 10.1.1.57. 6133&rep = repl &type = pdf.
  • 7Stumme G. Conceptual Knowledge Discovery with Frequent Concept Lattices[ EB/OL]. [ 2010 - 10 - 12]. http://citeseerx, ist. psu. edu/viewdoc/download ;jsessionid = 923B8204DFDOAE19846 60669348676A97 doi = 10.1.1.14. 1608&rep = repl&type = pdf.
  • 8Hereth J, Stumme G, Wille R, et al. Conceptual Knowledge Discovery and Data Analysis [ EB/OL ]. [ 2010 - 10 - 12 ]. http:// citeseerx, ist. psu. edu/viewdoc/download? doi = 10. 1. 1. 92. 9519&rep = repl &type = pdf.
  • 9Stumme G, Taouil R, Bastide Y, et al. Fast Computation of Concept Lattices Using Data Mining Technics[ EB/OL]. [ 2010 -10 -12 ]. http ://kobra. bibliothek, uni - kassel, de/bitstream/urn:nbn : de : hebis : 34 - 2009013026110/1/StummeFastComputation_ 2000. pdf.
  • 10Bastide Y, Pasquier N, Taouil R, et al. Mining Minimal Non -redundant Association Rules Using Frequent Closed Itemsets [ EB/ OL]. [2010 - 10 - 14 ]. http://kobra, bibliothek, uni - kassel. de/bitstream/um : nbn : de : hebis : 34 - 2009022326389/1/StummeMining_2000, pdf.

共引文献149

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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