###
计算机系统应用英文版:2017,26(1):157-162
本文二维码信息
码上扫一扫!
一种改进的Inter-Apriori算法
(西安理工大学 理学院, 西安 710054)
Improved Inter-Apriori Algorithm
(College of Science, Xi'an University of Technology, Xi'an 710054, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1017次   下载 1791
Received:April 07, 2016    Revised:June 12, 2016
中文摘要: 建立了一种基于定位和权值事务项集的挖掘算法,该算法只需扫描一遍事务数据库.利用垂直型布尔矩阵来存储交易数据,通过“与”运算与权值来计算计算支持度,利用定位搜索和合并事务矩阵相同列来剪枝,从而减少了算法在挖掘过程中使用的存储空间和计算时间.实验结果表明,改进算法在性能上得到了的明显提高.
Abstract:This paper establishes a mining algorithm based on the location and weight transaction item sets.It needs to scan the transaction database once.The algorithm adopts the vertical Boolean matrix to store transaction data, and the logic "and" operation and weight to calculate the support.Then it prunes through the searching location and combining the same columns of transaction matrix.Thereby the storage space and computing time used by the algorithm in the mining process can be reduced.The experimental results show that the improved algorithm performance has been significantly improved.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(51379172)
引用文本:
崔双弥,张德生.一种改进的Inter-Apriori算法.计算机系统应用,2017,26(1):157-162
CUI Shuang-Mi,ZHANG De-Sheng.Improved Inter-Apriori Algorithm.COMPUTER SYSTEMS APPLICATIONS,2017,26(1):157-162