| 一种交互式可约束的最小关联规则集挖掘算法 |
| |
| 引用本文： | 卢炎生,张蕊,王澎.一种交互式可约束的最小关联规则集挖掘算法[J].华中科技大学学报(自然科学版),2003,31(2):9-10. |
| |
| 作者姓名： | 卢炎生 张蕊 王澎 |
| |
| 作者单位： | 华中科技大学计算机科学与技术学院 |
| |
| 基金项目： | 科技部“十五”预研项目 . |
| |
| 摘 要： | 给出三类约束，并讨论了约束的反单调性，实现了一种交互式的可约束的最小关联规则集挖掘算法，并分析了算法的优越性。
|
| 关 键 词： | 交互式 可约束 最小关联规则集挖掘算法 数据挖掘 ISARS算法 反单调性 |
| 文章编号： | 1671-4512(2003)02-0009-02 |
An interactive algorithm for mining the smallest association rule set under constraints |
| |
| Lu Yansheng,Zhang Rui,Wang pengLu Yansheng Prof., College of Computer Sci. & Tech.,Huazhong Univ. of Sci. & Tech.,Wuhan ,China..An interactive algorithm for mining the smallest association rule set under constraints[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2003,31(2):9-10. |
| |
| Authors: | Lu Yansheng Zhang Rui Wang pengLu Yansheng Prof College of Computer Sci & Tech Huazhong Univ of Sci & Tech Wuhan China |
| |
| Institution: | Lu Yansheng,Zhang Rui,Wang pengLu Yansheng Prof., College of Computer Sci. & Tech.,Huazhong Univ. of Sci. & Tech.,Wuhan 430074,China. |
| |
| Abstract: | Mining of association rules is considered to be one of the most important data mining task. A convenient and efficient algorithm is what users like. Three kinds of constraints and anti monotonicity were discussed. An interactive algorithm for mining the smallest rule set under constraints was presented. Our analysis shows that it works more efficiently. |
| |
| Keywords: | data mining association rule algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
