| 对Bordat建格算法的一个改进 |
| |
| 引用本文： | 赵志坤,李义杰.对Bordat建格算法的一个改进[J].中国科技信息,2007,11(4):275-278. |
| |
| 作者姓名： | 赵志坤 李义杰 |
| |
| 作者单位： | 辽宁工程技术大学电子与信息工程系,125105 |
| |
| 摘 要： | Bordat建格算法是一种有效的基于形式背景建造概念格的算法,在Bordat算法中,需要频繁地扫描数据库,并且在子节点生成时,重复生成了许多重复的节点。本文对概念格建格算法Bordat进行深入分析,对该算法进行改进。新的算法只需一次扫描数据库就能够生成概念格,并有效地克服了Bordat算法中重复节点重复产生的问题。
|
| 关 键 词： | 关联规则 概念格 |
The Improvement to Bordat Algorithm |
| |
| Zhao Zhikun,Li Yijie.The Improvement to Bordat Algorithm[J].CHINA SCIENCE AND TECHNOLOGY INFORMATION,2007,11(4):275-278. |
| |
| Authors: | Zhao Zhikun Li Yijie |
| |
| Institution: | Department of Electronic and Information Engineering,Liaoning Technical University,Huludao 125105,China |
| |
| Abstract: | Bordat algorithm is an effective algorithm which canconstruct concept lattice based on a formal context.In this algorithm,it needs frequently scanning the DB,and in the sub-nodes generation algorithm,it makesthe same node comes repeatedly.This paper deepanalyze the Bordat algorithm. Based on the analysisabove,the paper gives an improved algorithm,whichcan make a concept lattice through only one timescanning of database, and can also effectivelyovercome the shortage in Bordat algorithm thatmakes the same node come repeatedly. |
| |
| Keywords: | Bordat |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
