高级检索

    基于互关联后继树的概念格构造算法

    An IRST-Based Algorithm for Construction of Concept Lattices

    • 摘要: 概念格是知识工程中一个重要的知识表达工具 ,同时也是形式概念分析的核心 目前已出现了许多有效的概念格构造算法 提出了一个基于互关联后继树的概念格构造算法 ,以扩展的互关联后继树为数据模型 ,通过对树的搜索和相关判定定理完成所有形式概念的生成 分析了算法的性能 ,并做出相关结论

       

      Abstract: Concept lattice is an important knowledge representation tool in knowledge engineering It is also the core of FCA Several algorithms are generated for computation of concept lattices An IRST based algorithm is introduced for construction of concept lattices by an extended IRST as data modal The algorithm constructs concept lattice by searching IRST and related determinant theorem The complexity of the algorithm is analyzed and some conclusions are arrived at

       

    /

    返回文章
    返回