首页 | 本学科首页   官方微博 | 高级检索  
     

基于属性预扫描的不确定性函数依赖挖掘
引用本文:卫强,周晓沧. 基于属性预扫描的不确定性函数依赖挖掘[J]. 清华大学学报(自然科学版), 2009, 49(6): 920-924
作者姓名:卫强  周晓沧
作者单位:清华大学,经济管理学院,管理科学与工程系,北京,100084;清华大学,经济管理学院,管理科学与工程系,北京,100084
基金项目:国家自然科学基金资助项目(70231010,70621061)
摘    要:函数依赖是关系数据库和数据建模中所需的关键约束知识。在海量数据中挖掘函数依赖时为降低噪音干扰和提高效率,该文采用带有满意度函数依赖的概念及挖掘带有满意度函数依赖的算法(MFDD),对噪音进行测度与表达,并有效挖掘得到函数依赖最小集。利用对属性散列度的测度概念,在带有满意度函数依赖的理论框架内采用3条优化策略,实现了属性预扫描算法。结果表明:基于该算法可显著提高挖掘效率。

关 键 词:数据库  数据挖掘  带有满意度函数依赖  散列度

Discovering functional dependencies with degrees of satisfaction using attribute pre-scanning
WEI Qiang,ZHOU Xiaocang. Discovering functional dependencies with degrees of satisfaction using attribute pre-scanning[J]. Journal of Tsinghua University(Science and Technology), 2009, 49(6): 920-924
Authors:WEI Qiang  ZHOU Xiaocang
Affiliation:Department of Management Science and Engineering;School of Economics and Management;Tsinghua University;Beijing 100084;China
Abstract:The functional dependency(FD) is a key constraint knowledge in relational databases and data modeling.However,noisy data and low efficiencies restrict the ability to mine functional dependencies in massive databases.Functional dependencies with degrees of satisfaction were used to discover minimal sets of functional dependencies(MFDD).The method not only measures the noises,but also efficiently discovers the minimal set of functional dependencies.A degree of diversity was used with a pre-scanning operation ...
Keywords:database  data mining  functional dependency with degree of satisfaction  degree of diversity  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号