| 基于概念格提取简洁关联规则 |
| |
| 引用本文： | 李云,李拓,蔡俊杰,陈崚. 基于概念格提取简洁关联规则[J]. 南京邮电大学学报(自然科学版), 2007, 27(3): 44-47,53 |
| |
| 作者姓名： | 李云 李拓 蔡俊杰 陈崚 |
| |
| 作者单位： | 扬州大学,信息工程学院,江苏,扬州,225009;扬州大学,信息工程学院,江苏,扬州,225009;扬州大学,信息工程学院,江苏,扬州,225009;扬州大学,信息工程学院,江苏,扬州,225009 |
| |
| 基金项目： | 国家自然科学基金 , 江苏省自然科学基金 |
| |
| 摘 要： | 从量化封闭项集格所提取的所有最小无冗余规则,虽满足最小前件最大后件的要求,但并不是满足用户设定支持度和置信度的最小规则集.本文提出了一种全局简洁关联规则,使所提取的规则集最小,并给出了基于量化封闭项集格提取全局简洁规则的算法.
|
| 关 键 词： | 概念格 关联规则 量化封闭项集格 |
| 文章编号： | 1673-5439（2007）03-0044-04 |
| 收稿时间： | 2006-08-17 |
| 修稿时间： | 2006-08-17 |
Extracting Succinct Association Rules Based on Concept Lattice |
| |
| LI Yun,LI Tuo,CAI Jun-jie,CHEN Ling. Extracting Succinct Association Rules Based on Concept Lattice[J]. JJournal of Nanjing University of Posts and Telecommunications, 2007, 27(3): 44-47,53 |
| |
| Authors: | LI Yun LI Tuo CAI Jun-jie CHEN Ling |
| |
| Affiliation: | School of Information Engineering, Yangzhou University, Yangzhou 225009, China |
| |
| Abstract: | The minimum non-redundant rules with the minimal anteceadence and maximal consequence can be extracted from the quantitative closed itemset lattice, but such rules are not the minimum set satisfying the userspecified threshold. In this paper, we propose the global succinct association rules with the least ests, and an algorithm is presented to obtain such rules extracted from Quantitative closed itemset lattice. |
| |
| Keywords: | concept lattice association rule quantitative closed itemset lattice |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
