Have a personal or library account? Click to login
An Algorithm for Mining High Utility Sequential Patterns with Time Interval Cover

An Algorithm for Mining High Utility Sequential Patterns with Time Interval

Open Access
|Dec 2019

Abstract

Mining High Utility Sequential Patterns (HUSP) is an emerging topic in data mining which attracts many researchers. The HUSP mining algorithms can extract sequential patterns having high utility (importance) in a quantitative sequence database. In real world applications, the time intervals between elements are also very important. However, recent HUSP mining algorithms cannot extract sequential patterns with time intervals between elements. Thus, in this paper, we propose an algorithm for mining high utility sequential patterns with the time interval problem. We consider not only sequential patterns’ utilities, but also their time intervals. The sequence weight utility value is used to ensure the important downward closure property. Besides that, we use four time constraints for dealing with time interval in the sequence to extract more meaningful patterns. Experimental results show that our proposed method is efficient and effective in mining high utility sequential pattern with time intervals.

DOI: https://doi.org/10.2478/cait-2019-0032 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702
Language: English
Page range: 3 - 16
Submitted on: May 29, 2019
Accepted on: Nov 26, 2019
Published on: Dec 11, 2019
Published by: Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2019 Tran Huy Duong, Demetrovics Janos, Vu Duc Thi, Nguyen Truong Thang, Tran The Anh, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.