| 基于量化封闭项集格提取最小无冗余近似规则 |
| |
| 引用本文： | 李云,刘宗田,程伟,谢翠华,吴强.基于量化封闭项集格提取最小无冗余近似规则[J].复旦学报(自然科学版),2004,43(5):801-804. |
| |
| 作者姓名： | 李云 刘宗田 程伟 谢翠华 吴强 |
| |
| 作者单位： | 上海大学,计算机学院,上海200072;扬州大学,信息工程学院,扬州,225009;上海大学,计算机学院,上海200072;扬州大学,信息工程学院,扬州,225009 |
| |
| 基金项目： | 国家自然科学基金，60275022， |
| |
| 摘 要： | 为便于规则的提取，提出了具有新的节点结构的量化封闭项集格．最小无冗余近似规则具有最小前件和最大后件，并且没有任何信息丢失；还提出了一个新的算法，可以从量化封闭项集格中直接提取最小无冗余近似规则．
|
| 关 键 词： | 频繁封闭项集 量化封闭项集格 近似规则 |
Extracting Minimal Non-Redundant Approximate Rules Based on Quantitative Closed Itemset Lattice |
| |
| Abstract.Extracting Minimal Non-Redundant Approximate Rules Based on Quantitative Closed Itemset Lattice[J].Journal of Fudan University(Natural Science),2004,43(5):801-804. |
| |
| Authors: | Abstract |
| |
| Abstract: | For extracting rules conveniently, the quantitative closed itemset lattice is proposed with the modified node structure. Minimal non-redundant approximate rules are what with minimal antecedent and maximal consequent and without reducing any information; and an novel algorithm is presented, which can directly extract such rules from the quantitative closed itemset lattice. |
| |
| Keywords: | frequent closed itemset quantitative closed itemset lattice approximate rule |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
