<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></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.

An Algorithm for Mining High Utility Sequential Patterns with Time Interval

Institute of Information Technology, Vietnam Academy of Science and Technology

Computer and Automation Institute Hungarian Academy of Sciences

Cybernetics and Information Technologies

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"An Algorithm for Mining High Utility Sequential Patterns with Time Interval"}

Mining High Utility Sequential Patterns (HUSP) is an emerging topic in data mining which attracts many researchers. The HUSP mining algorithms can extract...

An Algorithm for Mining High Utility Sequential Patterns with Time Interval

Data publikacji: 11 gru 2019

Zakres stron: 3 - 16

Otrzymano: 29 maj 2019

Przyjęty: 26 lis 2019

DOI: https://doi.org/10.2478/cait-2019-0032

Słowa kluczowe
Datamining, sequential pattern, time interval, high utility

© 2018 Tran Huy Duong et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

An Algorithm for Mining High Utility Sequential Patterns with Time Interval

Data publikacji: 11 gru 2019

Zakres stron: 3 - 16

Otrzymano: 29 maj 2019

Przyjęty: 26 lis 2019

DOI: https://doi.org/10.2478/cait-2019-0032

Słowa kluczoweDatamining, sequential pattern, time interval, high utility

© 2018 Tran Huy Duong et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Słowa kluczowe
Datamining, sequential pattern, time interval, high utility