FOSHU: faster on-shelf high utility itemset mining - with or without negative unit profit
Lists
Only you see this
Abstract
High utility itemset (HUI) mining is a popular data mining task, which consists of discovering sets of items generating high profit in a transaction database. Recently, several efficient algorithms have been proposed for this task. But, most of them do not consider the on-shelf time periods of items, which thus lead to a bias toward items having more shelf time. Moreover, most algorithms cannot handle databases containing items with a negative unit profit, although this case is very common in real transaction databases. In this paper, we address both of these challenges by proposing a novel efficient algorithm named FOSHU (Faster On-Shelf High Utility itemset miner) to mine HUIs while considering on-shelf time periods of items, and items having positive and/or negative unit profit. An extensive experimental study with real-life datasets shows that the proposed algorithm can be up more than 1000 times faster and use up to 10 times less memory than the state-of-the-art algorithm TS-HOUN for this task. Moreover, experiments show that the proposed algorithm performs well on dense database and databases containing many time periods.
BibTeX
@inproceedings{fournierviger2015foshu,
author = {Philippe Fournier-Viger and Souleymane Zida},
title = {{FOSHU: faster on-shelf high utility itemset mining - with or without negative unit profit}},
booktitle = {SAC},
year = {2015},
doi = {10.1145/2695664.2695823},
}Loading related content...