An Algorithm for Mining High Utility Sequential Patterns with Time Interval

Duong, H T and Demetrovics, János and Thi, V D and Thang, N T and Anh, T T (2019) An Algorithm for Mining High Utility Sequential Patterns with Time Interval. CYBERNETICS AND INFORMATION TECHNOLOGIES, 19 (4). pp. 3-16. ISSN 1311-9702 10.2478/cait-2019-0032

[img] Text
Duong_3_31585540_ny.pdf

Download (823kB)

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.

Item Type: Article
Uncontrolled Keywords: Time interval; Datamining; sequential pattern; high utility;
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 08 Dec 2020 09:31
Last Modified: 08 Dec 2020 09:31
URI: http://eprints.sztaki.hu/id/eprint/10007

Update Item Update Item