.png){kind=icon}
.png){kind=icon}
Return
An Efficient Approach for Mining Reliable High Utility Patterns
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3139028.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Utility mining is one of the most thriving research topics with a wide range of real-world applications. High utility pattern mining uses a utility function to extract all desired patterns that exceed a minimum utility threshold. However, a significant number of patterns will be generated if this threshold is set too low, which is an inherent limitation of these algorithms. This may cause the mining process to be inefficient as it would be difficult to analyze the patterns found. Furthermore, most of these patterns are unreliable and hard to be employed in making decisions. This paper proposed a novel problem of mining reliable high utility patterns by adapting the concept of reliability to mine a significant type of pattern called reliable high utility patterns. To address this issue, an efficient approach named RUPM (Reliable Utility-based Pattern Mining) is presented. RUPM introduces three novel measurements for estimating the reliability of utility-based patterns and proposes several strategies to efficiently handle reliable patterns with high utility values. Experimental results suggest that up to 99% of the patterns discovered by existing traditional high utility pattern mining algorithms were, in fact, unreliable. In contrast, the average reliability proportion in the resultant patterns obtained from the RUPM approach is at least 47.6% higher. Moreover, the proposed pruning strategies provide a reduction in both the runtime and memory usage.
Keywords:
Reliability
Itemsets
Data mining
Prediction algorithms
Correlation
Time measurement
Weight measurement
Data mining
reliable high-utility itemset
utility mining
pruning strategy
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
View more organizations