OSUMI: On-Shelf Utility Mining from Itemset-based Data
2020
As an important technique for dealing with transactional database in the field of data mining, high-utility itemset mining (HUIM) can be used to discover itemsets which have a high utility. However, it has a bias when towarding the item combinations which have more exhibition period since they have more opportunity to generate a high utility. To address this, the on-shelf time period of items need to be considered, thus on-shelf utility mining (OSUM) can be applied in the application which is more closer to the actual situation. Currently several models have been proposed to deal with the OSUM problem, but they still suffer from the requirement that it needs to maintain a massive candidates in memory and to scan database many times. In this paper, we propose an effective algorithm named OSUMI (On-Shelf Utility Mining from Itemset-based data) which can discover the on-shelf itemsets with high utility in a more practical way. More precisely, in order to avoid the problems of high memory consumption, OSUMI applies some properties of on-shelf utility. Besides, two upper-bounds named subtree utility and local utility are applied to prune the search space. Finally, an extensive experimental study on two real on-shelf datasets shows that our proposed algorithm can be significantly faster than the state-of-the-art algorithm for this mining task.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
37
References
2
Citations
NaN
KQI