Abstract
High utility thing sets (HUIs) mining is a rising subject in information mining.HUIs determined
least utility edge min utility. Notwithstanding, setting min utility suitably is a troublesome issue for clients.
As a rule, finding a fitting least utility edge by experimentation is a monotonous procedure for clients. In the
event that min utility is Set too low, an excessive number of HUIs will be produced, which may bring about
the mining procedure to be exceptionally wasteful. Then again, if min utility is set too high, it is likely that
no HUIs will be found. In this paper, we address the above issues by proposing another structure for top-k
high utility thing set mining, where k is the coveted number of HUIs to be mined.