| 一种发现函数依赖集的方法及应用 |
| |
| 引用本文： | 张守志,施伯乐.一种发现函数依赖集的方法及应用[J].软件学报,2003,14(10):1692-1696. |
| |
| 作者姓名： | 张守志 施伯乐 |
| |
| 作者单位： | 复旦大学,计算机与信息技术系,上海,200433 |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China under Grant No.69933010 (国家自然科学基金) |
| |
| 摘 要： | 介绍了一种发现最小函数依赖集的方法.这种方法基于一致集的概念,根据一致集导出最大集及其补集,然后生成最小非平凡函数依赖集.通过使用带状划分数据库减少求一致集的运算次数,使用逐层求精的算法来计算最小非平凡函数依赖集的左部.其结果可用于数据库的重新组织和设计、属性约简、聚类、关联规则提取等知识发现工作中.
|
| 关 键 词： | 最小函数依赖集 一致集 超图 属性约简 |
| 收稿时间： | 2002/12/17 0:00:00 |
| 修稿时间： | 3/5/2003 12:00:00 AM |
A Method for Discovering Functional Dependencies and Its Application |
| |
| ZHANG Shou-Zhi and SHI Bai-Le.A Method for Discovering Functional Dependencies and Its Application[J].Journal of Software,2003,14(10):1692-1696. |
| |
| Authors: | ZHANG Shou-Zhi and SHI Bai-Le |
| |
| Abstract: | An efficient method is introduced for discovering minimal functional dependencies from large database. It is based on the concept of agree sets. From agree sets, maximal sets and its complements are derived, and all minimal non-trivial functional dependencies can be generated. The computation of agree sets can be decreased by using stripped partition database. A levelwise algorithm is used for computing the left hand sides of minimal non-trivial functional dependencies. This method can be used to attribute reduction, clustering and mining associate rules, etc. in knowledge discovery as well as reorganization and design of databases. |
| |
| Keywords: | minimal functional dependencies agree set hypergraph attribute reduction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
