期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2017
卷号：5
期号：10
页码：16087
DOI：10.15680/IJIRCCE.2017.0510075
出版社：S&S Publications
摘要：High utility item sets (HUIs) mining is a rising subject in information mining.HUIs determined leastutility edge min utility. Setting an appropriate min utility threshold is a difficult problem for users. In the event that minutility is set too low, an excessive number of HUIs will be produced, which may bring about the mining procedure tobe exceptionally wasteful. Then again, if min utility is set too high, it is likely that no HUIs will be found. In this paperthe above issues by proposing a new framework named efficient hybrid algorithm for high utility item set in parallelmining using TKU and TKO, where k is the desired number of HUIs to be mined. Two sorts of proficient calculationsnamed TKU (mining Top-K Utility item sets) and TKO (mining Top-K utility item sets in one stage) are proposed formining such item sets without the need to set min utility. We give an auxiliary examination of the two calculations withtalks on their preferences and restrictions. TKO and TKU have excellent performance and scalability.
关键词：Utility mining; high utility item set mining; top-k pattern mining; top-k high utility item set mining
