| 基于同类概念的概念格横向合并算法 |
| |
| 引用本文： | 张磊,沈夏炯,贾培艳,许研.基于同类概念的概念格横向合并算法[J].计算机应用,2006,26(8):1900-1903. |
| |
| 作者姓名： | 张磊 沈夏炯 贾培艳 许研 |
| |
| 作者单位： | 1. 河南大学,计算机与信息工程学院,河南,开封,475001;河南大学,数据与知识工程研究所,河南,开封,475001
2. 河南大学,计算机与信息工程学院,河南,开封,475001 |
| |
| 摘 要： | 提出了同类概念的观点，在格的合并算法中通过利用同域概念格之间的同类概念和概念的父—子关系实现对其所有子节点的快速更新，以提高概念格横向合并算法的时间效率。并进一步论证了把节点数量较少的格插入到节点多的格中比反着做更省时间。实验表明，该算法和相关文献中的同域概念格横向合并算法相比，其时间性能有明显改善。
|
| 关 键 词： | 同域概念格 并行构造 横向合并 同类概念 |
| 文章编号： | 1001-9081（2006）08-1900-04 |
| 收稿时间： | 2006-02-13 |
| 修稿时间： | 2006-02-132006-03-24 |
Horizontal union algorithm of concept lattice based on Congener concept |
| |
| ZHANG Lei,SHEN Xia-jiong,JIA Pei-yan,XU Yan.Horizontal union algorithm of concept lattice based on Congener concept[J].journal of Computer Applications,2006,26(8):1900-1903. |
| |
| Authors: | ZHANG Lei SHEN Xia-jiong JIA Pei-yan XU Yan |
| |
| Affiliation: | 1. School of Computer and Information Engineering, Henan University, Kaifeng Henan 475004, China; 2. Institute of Data and Knowledge Engineering, Henan University, Kaifeng Henan 475004, China |
| |
| Abstract: | Congener concept was introduced into the lattice union algorithm, which was used to update each child node in less time according to the order relation of the concepts. It was further testified that to insert a small lattice into a large one would spend less time. The test results show that this algorithm makes better improvement in time complexity than the horizontal union algorithms of common universe concept lattice found in related literature. |
| |
| Keywords: | common universe concept lattice parallel construction horizontal union congener concept |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
