This paper presents a synthetic data generator that outputs timestamped transactional data with embedded temporal patterns controlled by a set of input parameters. In particular, calendar schema, which is determined by a hierarchy of input time granularities, is used as a framework of possible temporal patterns. An example of calendar schema is (year, month, day), which provides a framework for calendar-based temporal patterns of the form , where each is either an integer or the symbol . For example, is such a pattern, which corresponds to the time intervals consisting of all the 16th days of all months in year 2000. This paper also evaluates the data generator through a series of experiments. The synthetic data generator is intended to provide support for data mining community in evaluating various aspects (especially the temporal aspects and the scalability) of data mining algorithms.
[1]
Ramakrishnan Srikant,et al.
Fast Algorithms for Mining Association Rules in Large Databases
,
1994,
VLDB.
[2]
David Forster,et al.
A Representation for Collections of Temporal Intervals
,
1986,
AAAI.
[3]
Sridhar Ramaswamy,et al.
On the Discovery of Interesting Patterns in Association Rules
,
1998,
VLDB.
[4]
Sushil Jajodia,et al.
Time Granularities in Databases, Data Mining, and Temporal Reasoning
,
2000,
Springer Berlin Heidelberg.
[5]
Tomasz Imielinski,et al.
Mining association rules between sets of items in large databases
,
1993,
SIGMOD Conference.
[6]
Sushil Jajodia,et al.
Discovering calendar-based temporal association rules
,
2001,
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001.