A Rough Sets Partitioning Model for Mining Sequential Patterns with Time Constraint

Details A Rough Sets Partitioning Model for Mining Sequential Patterns with Time Constraint A Rough Sets Partitioning Model for Mining Sequential Patterns with Time Constraint

2009-06-23

arxiv.org/abs/0906.4327v1

IJCSIS, June 2009 Issue, Vol. 2, No.1

Computer Science

Databases

9 pages, International Journal of Computer Science and Information Security, IJCSIS 2009

Scientific paper

Now a days, data mining and knowledge discovery methods are applied to a variety of enterprise and engineering disciplines to uncover interesting patterns from databases. The study of Sequential patterns is an important data mining problem due to its wide applications to real world time dependent databases. Sequential patterns are inter-event patterns ordered over a time-period associated with specific objects under study. Analysis and discovery of frequent sequential patterns over a predetermined time-period are interesting data mining results, and can aid in decision support in many enterprise applications. The problem of sequential pattern mining poses computational challenges as a long frequent sequence contains enormous number of frequent subsequences. Also useful results depend on the right choice of event window. In this paper, we have studied the problem of sequential pattern mining through two perspectives, one the computational aspect of the problem and the other is incorporation and adjustability of time constraint. We have used Indiscernibility relation from theory of rough sets to partition the search space of sequential patterns and have proposed a novel algorithm that allows previsualization of patterns and allows adjustment of time constraint prior to execution of mining task. The algorithm Rough Set Partitioning is at least ten times faster than the naive time constraint based sequential pattern mining algorithm GSP. Besides this an additional knowledge of time interval of sequential patterns is also determined with the method.

Affiliated with

Also associated with

No associations

Rating

A Rough Sets Partitioning Model for Mining Sequential Patterns with Time Constraint 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 A Rough Sets Partitioning Model for Mining Sequential Patterns with Time Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Rough Sets Partitioning Model for Mining Sequential Patterns with Time Constraint will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-708689