二分搜索算法在全局频繁项目集求解中的应用  

Application of Two-Point Search Algorithm in the Solution of Global Frequent Project Set

作　　者：曾俊义 ZENG Jun-yi(College of Human Ecology,City College of Huizhou,Huizhou 516025)

机构地区：[1]惠州城市职业学院民生学院

出　　处：《现代计算机》2019年第19期24-27,共4页Modern Computer

摘　　要：为了解决常规算法在全局频繁项目求解中,存在求解准确率与求解速率较低的不足,提出二分搜索算法在全局频繁项目集求解中的应用。依托全局频繁项目集的确定,利用频繁项目k和全局隶属度函数x的计算,实现候选项目集的生成,优化全局频繁项目集求解体系;根据数据的动态求解,实现全局频繁项目集的更新计算,完成二分搜索算法在全局频繁项目集求解中的应用,实验数据表明,提出的全局频繁项目集求解方法,较传统求解方法具有较高的求解准确率和求解速率,适合于全局频繁项目集的求解。In order to solve the problem of low accuracy and low rate of global frequent project solving,proposes the application of binary search algo.rithm in global frequent project set solving.Based on the determination of the global frequent project set,realizes the generation of candi.date project set by using the calculation of frequent project K and global membership function X,and the solution system of global frequent project set is optimized.According to the dynamic solution of the data,realizes the updated calculation of the global frequent project set,and the application of the binary search algorithm in the global frequent project set solution is completed.The experimental data shows that the proposed global frequent project set solution method.Compared with the traditional method,it has higher accuracy and rate,and is suit.able for the solution of global frequent project set.

关 键 词：二分搜索算法 全局求解 频繁项目集 求解准确率 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]