Affiliations: [a] Thapar University, Patiala, India | [b] Guru Tegh Bahadur Institute, New Delhi, India
Correspondence:
[*]
Corresponding author: Bhawna Mallick, Head of the Department, Computer Science and Engineering, Galgotias College of Engineering and Technology, 1, Knowledge Park, Institutional Area, Phase II, Greater Noida, 201306, Uttar Pradesh, India. Tel.: +91 120 451 3800; Fax: +91 120 451 3880; E-mail: bhawna.mallick@gmail.com.
Abstract: Sequential pattern mining is a vital problem with broad applications. However, it is also challenging, as combinatorial high number of intermediate subsequences are generated that have to be critically examined. Most of the basic solutions are based on the assumption that the mining is performed on static database. But modern day databases are being continuously updated and are dynamic in nature. So, incremental mining of sequential patterns has become the norm. This article investigates the need for incremental mining of sequential patterns. An analytical study, focusing on the characteristics, has been made for more than twenty incremental mining algorithms. Further, we have discussed the issues associated with each of them. We infer that the better approach is incremental mining on the progressive database. The three more relevant algorithms, based on this approach, are also studied in depth along with the other work done in this area. This would give scope for future research direction.
