Efficient Support Coupled Frequent Pattern Mining Over Progressive Databases

Details Efficient Support Coupled Frequent Pattern Mining Over Progressive Databases Efficient Support Coupled Frequent Pattern Mining Over Progressive Databases

2010-05-29

arxiv.org/abs/1005.5434v1

International Journal of Database Management Systems 2.2 (2010) 73-82

Computer Science

Databases

10 Pages, IJDMS

Scientific paper

10.5121/ijdms.2010.2205

There have been many recent studies on sequential pattern mining. The sequential pattern mining on progressive databases is relatively very new, in which we progressively discover the sequential patterns in period of interest. Period of interest is a sliding window continuously advancing as the time goes by. As the focus of sliding window changes, the new items are added to the dataset of interest and obsolete items are removed from it and become up to date. In general, the existing proposals do not fully explore the real world scenario, such as items associated with support in data stream applications such as market basket analysis. Thus mining important knowledge from supported frequent items becomes a non trivial research issue. Our proposed novel approach efficiently mines frequent sequential pattern coupled with support using progressive mining tree.

Affiliated with

Also associated with

No associations

Rating

Efficient Support Coupled Frequent Pattern Mining Over Progressive Databases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Support Coupled Frequent Pattern Mining Over Progressive Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Support Coupled Frequent Pattern Mining Over Progressive Databases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-86206