期刊文献+

一种基于深度优先方法的构造概念格算法

A Algorithm for Constructing Concept Lattices Based on a Depth-first
下载PDF
导出
摘要 本文基于传统的Godin算法作出改进:在格结点更新过程的同时给出了边的更新方法,这样在边的更新过程中,减少了对更新格结点、新生格结点的遍历次数,从而提高了建格效率. In this paper,it aims to provide the improved algorithm based on the traditional Godin algorithm:it updates the edge while it is updating the lattice nodes.In the edge updating process,the traversal numbers of updating lattice nodes and new ones have been reduced.The improved algorithm has raised the efficiency of lattice building.
作者 唐竞胜 何伟
出处 《中央民族大学学报(自然科学版)》 2009年第S1期100-105,共6页 Journal of Minzu University of China(Natural Sciences Edition)
关键词 Godin算法 形式概念分析 概念格 深度优先 Hasse图 godin algorithm formal concept analysis concept lattice depth-first Hasse figure
  • 相关文献

参考文献8

  • 1沈夏炯,韩道军,刘宗田,马骏.概念格构造算法的改进[J].计算机工程与应用,2004,40(24):100-103. 被引量:26
  • 2谢志鹏,刘宗田.概念格的快速渐进式构造算法[J].计算机学报,2002,25(5):490-496. 被引量:120
  • 3Wille R.Restructuring lattice theory: an approach based on hierarchies of concepts. Ordered Sets . 1982
  • 4Bordat JP.Calcul pratique du treillis de galois d’une correspondance. Mathématiques et. Sciences Humaines . 1986
  • 5Godin R,Missaoui R,Alaoui H.Incremental concept formation algorithms based on Galois (concept) lattices. Computational Linguistics . 1995
  • 6Ho T B.Incremental conceptual clustering in the framework of Galois lattice. KDD:Techniques and Applications . 1997
  • 7M.Chein.Algorithme de recherch6 des sons-mmatrices d‘une matrice. Bull.Math.Soc.Sci.R,S.Roumanie . 1969
  • 8C CARPINETO,G ROMANO.Galois:an order-theoretic approach to conceptual clustering. Proceedings ICML,Machine Learning . 1993

二级参考文献16

  • 1GodinR,MissaouiR,AlaouiH.Incremental concept formation algorithms based on Galois(concept)lattices[J].Computa-tionalIntelligence,1995;11 (2) :246~267
  • 2Carpineto C, Romano G. Information retrieval through hybrid navigation of lattice representations. International Journal of Human-Computer Studies, 1996, 45: 553-578
  • 3Carpineto C, Romano G. A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning, 1996, 24(2):95-122
  • 4Godin 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
  • 5Godin R, Missaoui R, Alaoui H. Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence, 1995, 11(2):246-267
  • 6Godin 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
  • 7Nourine L, Raynaud O. A fast algorithm for building lattices. Information Processing Letters, 1999, 71(5-6):199-204
  • 8Snelting G, Tip T. Reengineering class hierarchies using concept analysis. In: Proc ACM SIGSOFT Symposium on the Foundations of Software Engineering, Lake Buena Vista, Frorida, USA, 1998. 99-110
  • 9Wille R. Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival I eds. Ordered Sets, Dordrecht: Reidel, 1982. 445-470
  • 10Xie Z, Liu Z. Research on classifier based on lattice structure. In: Proc Conference on Intelligent Information Processing, 16th World Computer Congress, Beijing, China, 2000. 333-338

共引文献129

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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