| 利用格结构特性生成概念格的算法 |
| |
| 引用本文： | 时百胜,刘宗田,余泓. 利用格结构特性生成概念格的算法[J]. 计算机工程, 2007, 33(21): 12-14 |
| |
| 作者姓名： | 时百胜 刘宗田 余泓 |
| |
| 作者单位： | 上海大学计算机工程与科学学院,上海,200072;苏州科技学院应用数学系,苏州,215009;上海大学计算机工程与科学学院,上海,200072;苏州科技学院应用数学系,苏州,215009 |
| |
| 摘 要： | 给出了概念格中关于后代和后继的一些性质，利用这些性质，提出了一种生成所有概念及其序关系的算法。对于任一形式概念，该算法能产生它的全部后代，并确认哪些后代为后继。为提高算法效率，采用了集合的精确匹配代替高代价的子集关系的检验。与现有算法相比，该算法的计算效率有显著的提高。
|
| 关 键 词： | 概念格 形式概念 后代 后继 算法 |
| 文章编号： | 1000-3428（2007）21-0012-03 |
| 修稿时间： | 2007-02-02 |
Algorithm of Building Concept Lattice Based on Its Structure |
| |
| SHI Bai-sheng,LIU Zong-tian,YU Hong. Algorithm of Building Concept Lattice Based on Its Structure[J]. Computer Engineering, 2007, 33(21): 12-14 |
| |
| Authors: | SHI Bai-sheng LIU Zong-tian YU Hong |
| |
| Affiliation: | 1. School of Computer Engineering and Science, Shanghai University, Shanghai 200072; 2. Department of Applied Mathematics, University of Science and Technology of Suzhou, Suzhou 215009 |
| |
| Abstract: | This paper gives some basic properties of children and successors in the concept lattice.By making use of these properties,it presents an algorithm to generate all concepts and its lattice order.Given a formal concept,this algorithm can produce all the children and identify all successors from them.During its implementation,the set exact matching takes place of against subset testing operations which is at a high price and the better computation efficiency is achieved. |
| |
| Keywords: | concept lattice formal concept child successor algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
