Mining top-k co-occurrence items with sequential pattern

doi:10.1016/j.eswa.2017.05.021

Mining top-k co-occurrence items with sequential pattern

2017-11-01

31

PRE

AI

DOI：10.1016/j.eswa.2017.05.021

Original

Original request for help

Save

Abstract

En 中文

Frequent sequential pattern mining has become one of the most important tasks in data mining. It has many applications, such as sequential analysis, classification, and prediction. How to generate candidates and how to control the combinatorically explosive number of intermediate subsequences are the most difficult problems. Intelligent systems such as recommender systems, expert systems, and business intelligence systems use only a few patterns, namely those that satisfy a number of defined conditions. Challenges include the mining of top-k patterns, top-rank-k patterns, closed patterns, and maximal patterns. In many cases, end users need to find itemsets that occur with a sequential pattern. Therefore, this paper proposes approaches for mining top-k co-occurrence items usually found with a sequential pattern. The Naive Approach Mining (NAM) algorithm discovers top-k co-occurrence items by directly scanning the sequence database to determine the frequency of items. The Vertical Approach Mining (VAM) algorithm is based on vertical database scanning. The Vertical with Index Approach Mining (VIAM) algorithm is based on a vertical database with index scanning. VAM and VIAM use pruning strategies to reduce the search space, thus improving performance. VAM and VIAM are especially effective in mining the co-occurrence items of a long input pattern. The three algorithms were evaluated using real-world databases. The experimental results show that these algorithms perform well, especially VAM and VIAM. (C) 2017 Elsevier Ltd. All rights reserved.

Keywords:

Top-k mining

Co-occurrence sequential mining

Sequential pattern mining

Mining top-k co-occurrence items with sequential pattern

Abstract

AI Summary

Journal

Organization