HIGH UTILITY ITEM INTERVAL SEQUENTIAL PATTERN MINING ALGORITHM

Authors

  • Tran Huy Duong
  • Nguyen Truong Thang
  • Vu Duc Thi
  • Tran The Anh

DOI:

https://doi.org/10.15625/1813-9663/36/1/14398

Keywords:

sequential pattern, time, item interval, high utility

Abstract

High utility sequential pattern mining is a popular topic in data mining with the main purpose is to extract sequential patterns with high utility in the sequence database. Many recent works have proposed methods to solve this problem. However, most of them does not consider item intervals of sequential patterns which can lead to the extraction of sequential patterns with too long item interval, thus making little sense. In this paper, we propose a High Utility Item Interval Sequential Pattern (HUISP) algorithm to solve this problem. Our algorithm uses pattern growth approach and some techniques to increase algorithm's performance.

Metrics

Metrics Loading ...

Downloads

Published

2020-02-27

How to Cite

[1]
T. H. Duong, N. T. Thang, V. D. Thi, and T. T. Anh, “HIGH UTILITY ITEM INTERVAL SEQUENTIAL PATTERN MINING ALGORITHM”, JCC, vol. 36, no. 1, p. 1–15, Feb. 2020.

Issue

Section

Articles