检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国民航大学工程技术训练中心,天津300300 [2]中国民航大学计算机科学与技术学院,天津300300
出 处:《电光与控制》2012年第5期36-41,共6页Electronics Optics & Control
基 金:国家自然科学基金项目(61103005);国家自然科学基金与中国民航联合资助项目(61179063);中央高校基本科研业务费(ZXH2011B003)
摘 要:针对属性粒度模糊划分需事先给定与Aprirori算法效率低的问题,提出基于自动模糊划分和改进Apriori算法的QAR关联规则生成方法。首先对QAR数据进行空缺值填补等预处理;然后给出最佳聚类准则并根据给出的最佳聚类准则得到最佳聚类,从而对QAR属性完成自动模糊划分及隶属函数的确定;之后通过记录数据项位置及简化连接与剪枝过程来提高Apriori算法的效率;并将其应用到QAR关联规则的生成过程;最后通过品质和性能度量两方面的实验,表明此方法在各方面的性能均优于经典方法。Considering the problems that attribute granularity fuzzy partition should be given in advance and the Apriori algorithm has low efficiency,we proposed a method for generating association rules in Quick Access Recorder(QAR) based on automatic fuzzy partition and improved Apriori algorithm.First,preprocessing was made for QAR data by filling the vacancies value.Then,the optimum clustering criteria was given and an optimum clustering was obtained according to the criteria.Thus the fuzzy partition of QAR attributes was implemented and membership function was determined.It improved the efficiency of the algorithm by recording the location of the data items and simplifying the process of the pruning and connection.It was applied in the generation of the QAR association rules.Experiment was made on quality and performance of the method,and the result showed that the method is superior to the classical method in all aspects of performance.
关 键 词:快速存取装置 机载记录系统 最佳聚类 模糊划分 关联规则
分 类 号:V19[航空宇航科学与技术—人机与环境工程] TP131[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222