王欣欣,张素兰

• 1:太原科技大学计算机科学与技术学院

摘要(Abstract)：

大多数概念格批处理构造算法,由于产生大量不满足外延最大扩展性的结点即冗余结点,导致相同内涵的结点重复生成,降低了概念格的构造效率。给出了一种新的基于对象扩展的概念格批处理构造算法(OEBCA),该算法对每层新生成的结点进行对象扩展,使其满足外延最大扩展性,相同内涵的结点只生成一次,从而避免了冗余结点的产生,提高了概念格的构造效率。实验结果表明,该算法是正确的和有效的。

关键词(KeyWords)： 概念格;冗余结点;对象扩展;批处理构造算法

Abstract:

Keywords:

基金项目(Foundation): 山西省自然科学基金项目(2006011041)

作者(Author): 王欣欣,张素兰

参考文献(References)：

• [1]W ILLE R.Restructuring lattice theory:an approach based on h ierarch ies of concepts.R ival I O rdered sets[M].Berlin:Dor-drecht re idel,1982.
• [2]胡可云,陆玉昌,石纯一.概念格及其应用扩展[J].清华大学学报(自然科学版),2000,40(9):77-81.
• [3]DEAN VAN DER MERWE,SERGEI OB IEDKOV,etc.AddIntent:A new Increm ental A lgorithm for Constructing Concept Lat-tices[C].Proceed ings of the Second International Conference on Form al ConceptAnalysis(ICFCA2004),2004,372-385.
• [4]TROY ADAM D,ZHANG GUO QIANG,TIAN YE.Faster Concept Analysis[C].Proceed ings of the 15 th international confer-ence on Conceptual Structures:Know ledge Arch itectures for Sm artApp lications(ICCS2007),2007,206-219.
• [5]VICKY CHO I.Faster A lgorithm s for Constructing a Concept(Galois)Lattice[J].Proceed ings of the the SIAM Conference onD iscrete M athem atics,2006.
• [6]KUZENTSOV SERGEI O.OBEDKOV SERGEIA.Comparing perform ance of algorithm s for generating concept lattices[J].Jour-nal of Experim ental and Theoretical Artific ial Intelligence,2002,14(23):189-216.
• [7]GOD IN R,M ISSAOUE R,ALAUIH.Incream ental concept form ation algorithm s based on Galois(concept)lattice[J],Compu-tational intelligence,1995,11(2):246-267.
• [8]GANTER B,等.形式概念分析[M].马垣,等译.北京:科学出版社,2007.
• [9]左孝凌,等.离散数学[M].上海:上海科学技术文献出版社,1981.
• [10]UC IM ach ine Learn ing Repository.http://arch ive.ics.uc i.edu/ML[DB/OL].2009-10-08.