| 基于概念格的最简规则挖掘算法 | |
| 邱卫根 ; QIU Wei-Gen | |
| 2010-06-09 ; 2010-06-09 | |
| 关键词 | 规则获取 形式概念格 扩展不可分辨矩阵 内涵缩减 Rule Acquisition,Formal Concept Lattice,Extended Indistinguishable Matrix,Intension Reduction TP181 |
| 其他题名 | Mining Algorithm for Minimal Rule Based on Concept Lattice |
| 中文摘要 | 概念格是知识处理和数据分析的重要数学工具.概念格快速构造算法对挖掘关联规则非常重要.本文构造了决策表对应的形式背景和概念格模型,分析了扩展不可分辨矩阵、概念格和最简决策规则发现之间的关系:概念格的内涵都来自于扩展不可分辨矩阵的特征元,最简决策规则的条件元一定是概念格某个结点的内涵缩减.本文给出了形式概念格的快速渐进式构造算法和基于概念格的最简规则获取算法,该算法直观简捷.最后以一个工程实例对本算法的有效性作出了证明.; The concept lattice is an important mathematic tool for knowledge treatment and data analysis,its efficient construction algorithm is significant in rules acquisition of decision table.In this paper,the formal context and concept lattice model of decision table are constructed,the relationships among the extended indistinguishable matrix,concept lattice and minimal rule are analyzed.All the concept node intension comes from property element of extended indistinguishable matrix and all the condition properties of optimal decision rule are from the intension reduction of a concept lattice node.Two algorithms are developed for constructing the corresponding concept lattice incrementally and acquisition of minimal decision rule based on the concept lattice,and their simplicity and efficiency are proved by an enterprise example.; 国家自然科学基金资助项目(No.60474072) |
| 语种 | 中文 ; 中文 |
| 内容类型 | 期刊论文 |
| 源URL | [http://hdl.handle.net/123456789/56371]  |
| 专题 | 清华大学 |
| 推荐引用方式 GB/T 7714 | 邱卫根,QIU Wei-Gen. 基于概念格的最简规则挖掘算法[J],2010, 2010. |
| APA | 邱卫根,&QIU Wei-Gen.(2010).基于概念格的最简规则挖掘算法.. |
| MLA | 邱卫根,et al."基于概念格的最简规则挖掘算法".(2010). |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论