期刊文献+

一种基于直积运算的概念格合并算法

AN INCORPORATE ALGORITHM OF CONCEPT LATTICES BASED ON DIRECT PRODUCT OPERATION
下载PDF
导出
摘要 现有的渐进式概念格构造算法,不能有效利用已有的概念格。当形式背景的属性数目发生变化时,需要以单个属性或属性集合为对象,重新构造概念格。为此,提出了一种基于已有概念格的概念格合并算法,对已有概念格做直积运算,通过直积格和总格的映射关系,自底向上直接构造出总概念格。这个算法适用于属性交集为空的形式背景的合并。 The present incremental building algorithms of concept lattices cannot make full use of the existed concept lattices. When the number of attribute in formal context changes, it is neeessary to rebuild a new lattice based on single attribute or a set of attribute. A new algorithm for incorporating concept lattices based on the existed concept lattices is presented. The "together lattice" is built from bottom to top by direct product operation on the existed concept lattices and the mapping relation between the direct product lattice of two existed concept lattices and the "together lattice". The algorithm is fit for the formal contexts in which attribute sets have no intersection.
出处 《计算机应用与软件》 CSCD 北大核心 2008年第11期232-235,共4页 Computer Applications and Software
关键词 概念格 直积 形式背景 Concept lattice Direct product Formal context
  • 相关文献

参考文献13

  • 1Wille R. Restructuring lattice theory:an approach based on hierarchies of concepts. Rival I (ed). Ordered Sets [ C ]. Dordrecht-Boston : Reidel Publishing Company, 1982:445 - 470.
  • 2Godin R, Mineau G, Missaoui R, et at. Applying concept formation methods to software reuse [ J]. International Journal of Knowledge Engineering and Software Engineering, 1995,5 ( 1 ) :119 - 142.
  • 3Mineau G W, Godin R. Automatic structuring of knowledge bases by conceptual clustering [J]. IEEE Transaction on Knowledge and Data Engineering, 1995,7 (5) :824 - 828.
  • 4Cole R, Eklund P. Scalability in formal concept analysis [ J ]. Computational Intelligence, 1999,15 ( 1 ) : 11 - 27.
  • 5Carpineto C, Romano G. A lattice conceptual clustering system and its application to browsing retrieval [ J ]. Machine Learing, 1996,24 (2) :95 -122.
  • 6Godin R,Missaoui R. An incremental concept formation approach for learning from databases [J]. Theoretical Computer Science, 1994,133 (5) :387 -419.
  • 7Bordat J P. Calcul pratique du trellis de galois d' une correspondence [ J ]. Mathematiques et Sciences, 1986,96:31 - 47.
  • 8Lhouari Nourine, Olivier Raynaud. A fast algorithm for building lattices [ J ]. Information Processing Letters, 1999,71 ( 5 - 6) : 199 - 204.
  • 9Godin R. Incremental concept formation algorithms based on Galois (concept) lattices [ J ]. Computational Intelligence, 1995, 11 ( 2 ) :246 - 267.
  • 10Ganter B, Wille R. Formal concept analysis:mathematical foundations [ M ]. Berlin : Springer, 1999.

二级参考文献20

  • 1胡学钢 简宋全.基于扩展概念格的知识表示与构造:2000年亚太微型计算机会议论文[M].,..
  • 2王志海.合肥工业大学博士论文[M].,.83-89.
  • 3GodinR,MissaouiR,AlaouiH.Incremental concept formation algorithms based on Galois(concept)lattices[J].Computa-tionalIntelligence,1995;11 (2) :246~267
  • 4胡学钢,2000年亚太微型计算机会议论文
  • 5王志海,博士学位论文,83页
  • 6Carpineto C, Romano G. Information retrieval through hybrid navigation of lattice representations. International Journal of Human-Computer Studies, 1996, 45: 553-578
  • 7Carpineto C, Romano G. A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning, 1996, 24(2):95-122
  • 8Godin R, Mineau G W, Missaoui R. Incremental structuring of knowledge bases. In: Proc International Symposium on Knowledge Retrieval, Use, and Storage for Efficiency(KRUSE'95), Santa Cruz, 1995. 179-193
  • 9Godin R, Missaoui R, Alaoui H. Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence, 1995, 11(2):246-267
  • 10Godin R, Mili H, Mineau G W et al. Design of class hierarchies based on concept (Galois) lattices. Theory and Application of Object Systems, 1998, 4(2):117-134

共引文献138

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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