多最小效用阈值的频繁高效用项集快速挖掘算法

Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2018-10-11 Cooperative journals: 《计算机应用研究》

王斌 吕瑞瑞 房新秀 马俊杰

Abstract： In mining algorithm for high utility itemsets with multiple minimum utility threshold (MHUI) , calculation is often repeated and mining result itemsets are not frequent . This paper developed two new爁ast爉ining燼lgorithm SFMHUI and FMHUI. The FMHUI algorithm used the previous calculation result in the calculation of the minimum utility threshold of the itemsets, avoiding duplicate comparisons燽etween爄tems; in addition, the FMHUI algorithm defined the minimum utility threshold table EMMU-table of extensions of items to quickly calculate the minimum utility threshold of extensions, improving the爀fficiency. The SFMHUI algorithm added the support constraints on the basis of FMHUI, making the爉ining爄temsets燽oth爃igh-utility燼nd爁requent. The result from simulation experiments shows that the proposed algorithms are efficient and feasible.

 Hits 1783  Downloads 1016  Comment 0