An incremental mining algorithm using pre-large sequences

  Radhika Kailas Jagzap,  Nilesh G Pardeshi

Mining useful information and helpful knowledge from large databases has evolved into an important research area in recent years. Among the classes of knowledge derived, finding sequential patterns in temporal transaction databases is very important since it can help model customer behavior. In the past, researchers usually assumed databases were static to simplify data-mining problems. In real-world applications, new transactions may be added into databases frequently. Designing an efficient and effective mining algorithm that can maintain sequential patterns as a database grows is thus important. In this paper, we propose a novel incremental mining algorithm for maintaining sequential patterns based on the concept of pre-large sequences to reduce the need for rescanning original databases.

Keywords- Data mining, Sequential pattern, Large sequence, Pre-large sequence, Incremental mining.

Unique Identification Number - IJEDR1602264
Page Number(s) - 1479-1485
Pubished in - Volume 4 | Issue 2 | June 2016
DOI (Digital Object Identifier) -   
Publisher - IJEDR (ISSN - 2321-9939)

  Radhika Kailas Jagzap,  Nilesh G Pardeshi,   "An incremental mining algorithm using pre-large sequences", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.4, Issue 2, pp.1479-1485, June 2016, Available at :http://www.ijedr.org/papers/IJEDR1602264.pdf