| 约束概念格的代数性质及其知识表示的完备性 |
| |
| 引用本文： | 张继福,张素兰,蒋义勇.约束概念格的代数性质及其知识表示的完备性[J].模式识别与人工智能,2010,23(3):289-299. |
| |
| 作者姓名： | 张继福 张素兰 蒋义勇 |
| |
| 作者单位： | 太原科技大学 计算机科学与技术学院 太原 030024 |
| |
| 基金项目： | 国家自然科学基金项目，山西省回国留学人员科研项目 |
| |
| 摘 要： | 约束概念格是一种依据用户对数据集的兴趣、认识等作为背景知识而构造的概念格结构。文中利用约束概念格结点之间的上下确界运算，构造约束概念格的代数系统，证明约束概念格的若干代数性质，以及知识表示的完备性，从而为约束概念格的应用奠定理论基础。
|
| 关 键 词： | 数据挖掘 约束概念格 代数性质 知识表示 完备性 |
| 收稿时间： | 2009-04-23 |
Algebraic Properties of Constrained Concept Lattice and Its Completeness of Knowledge Representation |
| |
| ZHANG Ji-Fu,ZHANG Su-Lan,JIANG Yi-Yong.Algebraic Properties of Constrained Concept Lattice and Its Completeness of Knowledge Representation[J].Pattern Recognition and Artificial Intelligence,2010,23(3):289-299. |
| |
| Authors: | ZHANG Ji-Fu ZHANG Su-Lan JIANG Yi-Yong |
| |
| Affiliation: | School of Computer Science and Technology,Taiyuan University of Science and Technology,Taiyuan 030024 |
| |
| Abstract: | The constrained concept lattice is one type of concept lattice. It is constructed according to the background knowledge of usersinterest and knowledge on dataset. In this paper, the algebraic system of the constrained concept lattice is presented by defining operations of supremum and infimum among the constrained concept lattice nodes, and its algebra properties and completeness of knowledge representation are proved, thus the theoretical basis is established for the application of the constrained concept lattice. |
| |
| Keywords: | Data Mining Constrained Concept Lattice Algebraic Property Knowledge Representation Completeness |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《模式识别与人工智能》浏览原始摘要信息 |
|
点击此处可从《模式识别与人工智能》下载全文 |
