Research Article
Top ‘N’ Variant Random Forest Model for High Utility Itemsets Recommendation
@ARTICLE{10.4108/eai.25-1-2021.168225, author={Pazhaniraja N and Sountharrajan S and Suganya E and Karthiga M}, title={Top ‘N’ Variant Random Forest Model for High Utility Itemsets Recommendation}, journal={EAI Endorsed Transactions on Energy Web}, volume={8}, number={35}, publisher={EAI}, journal_a={EW}, year={2021}, month={1}, keywords={High Utility Itemset, Random forest, machine learning, association mining, frequent itemsets, feature selection}, doi={10.4108/eai.25-1-2021.168225} }
- Pazhaniraja N
Sountharrajan S
Suganya E
Karthiga M
Year: 2021
Top ‘N’ Variant Random Forest Model for High Utility Itemsets Recommendation
EW
EAI
DOI: 10.4108/eai.25-1-2021.168225
Abstract
High-utility based itemset mining is the advancement of recurrent pattern mining that discovers occurrence of frequent transactions from a huge database. The issues in frequent pattern mining involve the elimination of quantities purchased by the customers and cost of purchased product. This can be resolved by high utility itemset mining which includes quantities and profit of the products in the transactions. The conventional association rule mining algorithms results in huge memory consumption due to the complexity in pruning the search space. In this paper, machine learning based high-utility itemset mining is applied to predict next order in an online grocery store depending on the transactions. The overall goal is to enhance the business profitability by stocking the high utility items in market. The Top ‘N’ variant Random Forest model is proposed to recommend the high utility itemsets, thereby predicting the reordered/next ordered items. The model is evaluated using Instacart market dataset to measure accuracy, precision and recall.
Copyright © 2021 Pazhaniraja N et al., licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution license, which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.