| 基于互关联后继树的概念格构造算法 |
| |
| 引用本文： | 张凯,胡运发,王瑜.基于互关联后继树的概念格构造算法[J].计算机研究与发展,2004,41(9):1493-1499. |
| |
| 作者姓名： | 张凯 胡运发 王瑜 |
| |
| 作者单位： | 复旦大学计算机与信息技术系,上海,200433 |
| |
| 基金项目： | 国家自然科学基金项目 (60 173 0 2 7)，国家“八六三”高技术研究发展计划基金项目 (2 0 0 1AA115 0 2 0 ) |
| |
| 摘 要： | 概念格是知识工程中一个重要的知识表达工具，同时也是形式概念分析的核心．目前已出现了许多有效的概念格构造算法．提出了一个基于互关联后继树的概念格构造算法，以扩展的互关联后继树为数据模型，通过对树的搜索和相关判定定理完成所有形式概念的生成．分析了算法的性能，并做出相关结论．
|
| 关 键 词： | 形式概念分析 概念格 互关联后继树 概念支持度 |
An IRST-Based Algorithm for Construction of Concept Lattices |
| |
| ZHANG Kai,HU Yun Fa,and WANG Yu.An IRST-Based Algorithm for Construction of Concept Lattices[J].Journal of Computer Research and Development,2004,41(9):1493-1499. |
| |
| Authors: | ZHANG Kai HU Yun Fa and WANG Yu |
| |
| 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 |
| |
| Keywords: | FCA concept lattice IRST concept support |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
