US-Rule: Discovering Utility-driven Sequential Rules

  title={US-Rule: Discovering Utility-driven Sequential Rules},
  author={Gengsen Huang and Wensheng Gan and Jian Weng and Philip S. Yu},
  journal={ACM Transactions on Knowledge Discovery from Data (TKDD)},
Utility-driven mining is an important task in data science and has many applications in real life. High-utility sequential pattern mining (HUSPM) is one kind of utility-driven mining. It aims to discover all sequential patterns with high utility. However, the existing algorithms of HUSPM can not provide a relatively accurate probability to deal with some scenarios for prediction or recommendation. High-utility sequential rule mining (HUSRM) is proposed to discover all sequential rules with high… 

Figures and Tables from this paper

Towards Target Sequential Rules

This paper provides the relevant definitions of target sequential rule and proposes an efficient algorithm, called targeted sequential rule mining (TaSRM), which can achieve better experimental performance compared to the existing baseline algorithm.

Totally-ordered Sequential Rules for Utility Maximization

This paper proposes two novel algorithms, called TotalSR and TotalSR +, which aim to identify all high utility totally-ordered sequential rules (HTSRs), and introduces a left-first expansion strategy that can utilize the anti-monotonic property to use a confidence pruning strategy.



Efficient Mining of High-Utility Sequential Rules

This paper proposes a novel algorithm named HUSRM High-Utility Sequential Rule Miner, which includes several optimizations to mine high-utility sequential rules efficiently and shows that it is highly efficient and that its optimizations improve its execution time and memory usage.

Fast Utility Mining on Sequence Data

An efficient algorithm for the task of HUSP mining with UL-list (HUSP-ULL), which utilizes a lexicographic $q$ -sequence (LQS)-tree and a utility-linked (UL)-list structure to quickly discover HUSPs.

USpan: an efficient algorithm for mining high utility sequential patterns

This paper introduces the lexicographic quantitative sequence tree to extract the complete set of high utility sequences and design concatenation mechanisms for calculating the utility of a node and its children with two effective pruning strategies, and defines a generic framework for high utility sequence mining.

ProUM: Projection-based Utility Mining on Sequence Data

FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning

An extensive experimental study with four real-life datasets shows that the resulting algorithm named FHM (Fast High-Utility Miner) reduces the number of join operations by up to 95 % and is up to six times faster than the state-of-the-art algorithm HUI-Miner.

CRoM and HuspExt: Improving Efficiency of High Utility Sequential Pattern Extraction

An efficient data structures and pruning technique which is based on Cumulated Rest of Match (CRoM) based upper bound, which allows more conservative pruning before candidate pattern generation in comparison to the existing techniques is proposed.

An Efficient Algorithm for High Utility Sequential Pattern Mining

This paper devise two pruning strategies RSU and PDU, and proposes HUS-Span algorithm based on these two pruned strategies to efficiently identify high utility sequential patterns.

A Novel Approach for Mining High‐Utility Sequential Patterns in Sequence Databases

A novel framework for mining high‐utility sequential patterns for more real‐life applicable information extraction from sequence databases with non‐binary frequency values of items in sequences and different importance/significance values for distinct items is proposed.