Implementation of Algorithm for Finding Top-k High Utility Item sets
| Author(s) | : | D. Swapna, P. Hima Bindu, P. Sri Ramya, A. Siri Chandana |
| Institution | : | Assistant Professor, Computer Science and Engineering, BVRIT Hyderabad College of Engineering for Women |
| Published In | : | Vol. 4, Issue 3 — March 2017 |
| Page No. | : | 681-684 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
High utility item sets (HUIs) mining is an emerging technique in data mining. It helps in discovering all itemsets having a utility meeting a user-specified minimum utility threshold min_util. However, setting min_util appropriatelyis a difficult problem for users. Finding an appropriate min_util by trial and error is a difficult process for users. Ifmin_util is set too low, too many itemsets will be generated, which takes large search space and may cause the miningprocess to be very inefficient. On the other hand, if min_util is set too high, it is likely that no HUIs will be found. Toovercome this we have two phase mining techniques in which scalability and efficiency are bottleneck problems. Tosolve this, we use an algorithm named TKO(Top-k utility itemsets in one phase) in which the high utility itemsets aregenerated in one phase. It makes use of utility-list structure. It yields the top k utility itemsets where k is the userspecified value.
D. Swapna, P. Hima Bindu, P. Sri Ramya, A. Siri Chandana, “Implementation of Algorithm for Finding Top-k High Utility Item sets”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 3, pp. 681-684, March 2017.
