Mining Top-K High Utility Item Sets without Minimum Utility Threshold



High utility item sets mining is an emerging topic in data mining. Here refers discovering all item sets having a utility meeting a user specified minimum utility threshold. According to users it is a difficult to set min_util. If min_util is set too low, too many HUIs will be generated, it may cause the mining process very inefficient. If min_util is set too high, may be there is no HUIs. Here the above issues are addressed by proposing a new method for mining top-k high utility itemset. Here k is mentioned as the number of HUIs to be mined. Two algorithms named TKU (mining Top-K utility itemsets) and TKO(mining Top-K Utility itemsets) are proposed for mining. These algorithms mine the itemsets without setting min_util threshold. 

Full Text:



  • There are currently no refbacks.

Copyright (c) 2017 Edupedia Publications Pvt Ltd

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


EduPedia Publications Pvt Ltd, D-351, Prem Nagar-2, Suleman Nagar, Kirari, Nagloi, New Delhi PIN-Code 110086, India Through Phone Call us now: +919958037887 or +919557022047

All published Articles are Open Access at

Paper submission: or


Mobile:                  +919557022047 & +919958037887


Journals Maintained and Hosted by

EduPedia Publications (P) Ltd in Association with Other Institutional Partners

Pen2Print and IJR are registered trademark of the Edupedia Publications Pvt Ltd.