An Algorithm for Mining High Utility Sequential Patterns with Time Interval

摘要

Mining High Utility Sequential Patterns (HUSP) is an emerging topic indata mining which attracts many researchers. The HUSP mining algorithms canextract sequential patterns having high utility (importance) in a quantitativesequence database. In real world applications, the time intervals between elementsare also very important. However, recent HUSP mining algorithms cannot extractsequential patterns with time intervals between elements. Thus, in this paper, wepropose an algorithm for mining high utility sequential patterns with the time intervalproblem. We consider not only sequential patterns’ utilities, but also their timeintervals. The sequence weight utility value is used to ensure the important downwardclosure property. Besides that, we use four time constraints for dealing with timeinterval in the sequence to extract more meaningful patterns. Experimental resultsshow that our proposed method is efficient and effective in mining high utilitysequential pattern with time intervals.