| 双序渐进式概念格合并算法 |
| |
| 引用本文： | 姚佳岷,杨思春,李心磊,彭月娥. 双序渐进式概念格合并算法[J]. 计算机应用研究, 2013, 30(4): 1038-1040 |
| |
| 作者姓名： | 姚佳岷 杨思春 李心磊 彭月娥 |
| |
| 作者单位： | 1. 安徽工业大学 计算机学院, 安徽 马鞍山 243032; 2. 南京大学 计算机软件新技术国家重点实验室, 南京 210093 |
| |
| 基金项目： | 计算机软件新技术国家重点实验室开放课题基金资助项目（KFKT2010B02）; 安徽省高校省级自然科学研究重点项目（KJ2011A048） |
| |
| 摘 要： | 针对传统的概念格合并算法仅为单向的纵向或横向合并,提出一种基于概念内涵、外延升降序的双序渐进式合并算法。按照概念的内涵或外延的升序和降序,从两个方向(由上到下和由下到上)同时进行子概念格的纵向或横向合并。算法分析和示例结果表明,该算法不仅在结构上较好地保留了原有信息,而且在效率上也获得了显著的提高。
|
| 关 键 词： | 概念格 形式背景 概念格合并 内涵 外延 |
Incremental double sequence algorithm of concept lattice union |
| |
| YAO Jia-min,YANG Si-chun,LI Xin-lei,PENG Yue-e. Incremental double sequence algorithm of concept lattice union[J]. Application Research of Computers, 2013, 30(4): 1038-1040 |
| |
| Authors: | YAO Jia-min YANG Si-chun LI Xin-lei PENG Yue-e |
| |
| Affiliation: | 1. School of Computer Science, Anhui University of Technology, Ma'anshan Anhui 243032, China; 2. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China |
| |
| Abstract: | In existing literatures, the algorithms of concept lattice union are all one-way vertical or horizontal union. Based on concept lattice duality principle, this paper proposed a two-way union algorithm. Comparing with vertical or horizontal algorithms, this algorithm does union by the ascending and descending order of the intension and extension of concept. Algorithm analysis and example show that the new algorithm retains the structural information and its efficiency is significantly improved. |
| |
| Keywords: | concept lattice formal context concept lattice union intent extent |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
