High-utility itemset mining with effective pruning strategies

JMT Wu, JCW Lin, A Tamrakar - ACM Transactions on Knowledge …, 2019 - dl.acm.org
High-utility itemset mining is a popular data mining problem that considers utility factors,
such as quantity and unit profit of items besides frequency measure from the transactional …

High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates

U Yun, H Ryang, KH Ryu - Expert Systems with Applications, 2014 - Elsevier
High utility itemset mining considers the importance of items such as profit and item
quantities in transactions. Recently, mining high utility itemsets has emerged as one of the …

NetNCSP: Nonoverlapping closed sequential pattern mining

Y Wu, C Zhu, Y Li, L Guo, X Wu - Knowledge-based systems, 2020 - Elsevier
Sequential pattern mining (SPM) has been applied in many fields. However, traditional SPM
neglects the pattern repetition in sequence. To solve this problem, gap constraint SPM was …

Top-k high utility pattern mining with effective threshold raising strategies

H Ryang, U Yun - Knowledge-Based Systems, 2015 - Elsevier
In pattern mining, users generally set a minimum threshold to find useful patterns from
databases. As a result, patterns with higher values than the user-given threshold are …

OPP-Miner: Order-preserving sequential pattern mining for time series

Y Wu, Q Hu, Y Li, L Guo, X Zhu… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Traditional sequential pattern mining methods were designed for symbolic sequence. As a
collection of measurements in chronological order, a time series needs to be discretized into …

NetNMSP: Nonoverlapping maximal sequential pattern mining

Y Li, S Zhang, L Guo, J Liu, Y Wu, X Wu - Applied Intelligence, 2022 - Springer
Nonoverlapping sequential pattern mining, as a kind of repetitive sequential pattern mining
with gap constraints, can find more valuable patterns. Traditional algorithms focused on …

An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies

QH Duong, B Liao, P Fournier-Viger, TL Dam - Knowledge-Based Systems, 2016 - Elsevier
Top-k high utility itemset mining is the process of discovering the k itemsets having the
highest utilities in a transactional database. In recent years, several algorithms have been …

The lattice‐based approaches for mining association rules: a review

T Le, B Vo - Wiley Interdisciplinary Reviews: Data Mining and …, 2016 - Wiley Online Library
The traditional methods for mining association rules (ARs) include two phrases: mining
frequent itemsets (FIs)/frequent closed itemsets (FCIs)/frequent maximal itemsets (FMIs) and …

Efficient frequent pattern mining based on linear prefix tree

G Pyun, U Yun, KH Ryu - Knowledge-Based Systems, 2014 - Elsevier
Outstanding frequent pattern mining guarantees both fast runtime and low memory usage
with respect to various data with different types and sizes. However, it is hard to improve the …

NWP-Miner: Nonoverlapping weak-gap sequential pattern mining

Y Wu, Z Yuan, Y Li, L Guo, P Fournier-Viger, X Wu - Information Sciences, 2022 - Elsevier
Nonoverlapping sequential pattern mining (SPM) is a type of SPM with gap constraints that
can mine valuable information in sequences. One of the disadvantages of nonoverlapping …