.png){kind=icon}
.png){kind=icon}
Return
Mining high utility pattern with negative items in dynamic databases
.png){kind=icon}
OA
AI
DOI：10.1002/int.22794.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
High utility pattern mining with negative items (HUPMN) has more practical applications because it can process data with negative utility values. But the existing HUPMN algorithms assume that the database is static and it would be very expensive to use these algorithms directly to deal with dynamic databases. To cope with this challenge, an high utility pattern algorithm for mining negative items from an incremental database is proposed for the first time, and an incremental index list structure is designed, which uses index values to quickly access and update the information stored in the list. In addition, A memory reuse strategy is also applied to reduce memory usage. Finally, a HUPMN algorithm based on sliding window was proposed, which can quickly update item information when the window was sliding. Extensive experimental evaluations have been carried out on a variety of data sets, and the results show that the proposed algorithm exhibits excellent performance in terms of running time and memory usage.
Keywords:
high utility pattern mining
index
negative utility
sliding window
utility list
Journal
IF:
3.7
Papers:
3.0K
Citations:
8.1K