| 快速开采意外的规则 |
| |
| 引用本文： | 路松峰,卢正鼎.快速开采意外的规则[J].计算机工程与应用,2000,36(5):21-23. |
| |
| 作者姓名： | 路松峰 卢正鼎 |
| |
| 作者单位： | 华中理工大学计算机学院应用系,武汉,430074 |
| |
| 基金项目： | 国防预研基金!（94J3．4．2．J9W05） |
| |
| 摘 要： | 数据开采研究的主要任务就是发现数据集合中隐含的规则，发现的规则分为常规性规则和意外规则。由于意外规则的支持度很小，因而常常被人们忽略，然而意外规则代表了知识的另外一面，非常有用。文章提出一种快速有效发现意外规则的算法，该算法允许规则的结果为合取范式。
|
| 关 键 词： | 数据开采 意外 支持度 |
| 修稿时间： | 1999年12月 |
Fastly Mining Exceptional Rules |
| |
| Lu Songfeng,Lu Zhengding.Fastly Mining Exceptional Rules[J].Computer Engineering and Applications,2000,36(5):21-23. |
| |
| Authors: | Lu Songfeng Lu Zhengding |
| |
| Abstract: | Discovering implicit rules from data sets is the main task of data mining. The discovered rules can be devided into common rules and exceptional rules. The exceptional rules always be ignored because of their smaller supports. However, they represent a different fact from general knowledge and can be extremely useful. This paper presents a fast and efficient algorithm for discovering exceptional rules from data sets. This algorithm permits that the consequent of a rule is a conjunctive normal form. |
| |
| Keywords: | Data mining Exception Support |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
