| 树状结构组织的属性优先的概念格渐进式算法 |
| |
| 引用本文： | 毛华,窦林立,杨蕾. 树状结构组织的属性优先的概念格渐进式算法[J]. 计算机工程与应用, 2008, 44(27): 65-68. DOI: 10.3778/j.issn.1002-8331.2008.27.021 |
| |
| 作者姓名： | 毛华 窦林立 杨蕾 |
| |
| 作者单位： | 1.河北大学 数学与计算机学院，河北 保定 071002 2.河北省数学研究中心，石家庄 050016 3.河北省机器学习与计算智能重点实验室，河北 保定 071002 |
| |
| 基金项目： | 河北省自然科学基金专项基金 |
| |
| 摘 要： | 通过对概念格渐进式构造过程的分析，采用树结构对概念格节点进行组织，研究了利用这种树状组织的渐进式生成属性优先的概念格的构造算法。并结合实例说明了概念格的树结构组织在属性优先的渐进式生成概念格时，能有效地缩小产生子格节点的搜索范围和新增格节点的父节点和子节点的搜索范围，从而能快速生成概念格。
|
| 关 键 词： | 概念格 索引树 属性 |
| 收稿时间： | 2007-11-16 |
| 修稿时间： | 2008-3-13 |
Attribute-priority incremental formation algorithm of concept lattice based on tree structure |
| |
| MAO Hua,DOU Lin-li,YANG Lei. Attribute-priority incremental formation algorithm of concept lattice based on tree structure[J]. Computer Engineering and Applications, 2008, 44(27): 65-68. DOI: 10.3778/j.issn.1002-8331.2008.27.021 |
| |
| Authors: | MAO Hua DOU Lin-li YANG Lei |
| |
| Affiliation: | 1.School of Mathematics and Computer，Hebei University，Baoding，Hebei 071002，China 2.Mathematical Research Center of Hebei Province，Shijiazhuang 050016，China 3.Key Lab. in Machine Learning and Computational Intelligence of Hebei Province，Baoding，Hebei 071002，China |
| |
| Abstract: | Through analyzes the process of incrementally updating,the authors use tree structure of concept lattice to organize the set of concepts in concept lattice.Based on the tree structure,attribute-priority incremental formation algorithm is developed.Also demonstrates by an example that in the process of incrementally updating,the organization of concepts in tree structure can help to identify the node type and greatly reduce the search space of parents and children of new born concept node.Then it can obtain the concept lattice much faster. |
| |
| Keywords: | concept lattice tree index attribute |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
