Authors : E.R. Naganthan and F. Ramesh Dhanaseelan
Abstract: In this study, we propose a graph structure, that captures important data streams. This graph can be easily maintained and mined for frequent item sets as well as various other patterns like constrained item sets. This graph captures the contents of transaction in a window and arranges nodes according to some canonical order that is unaffected by changes in item frequency. This graph structure is designed for exact stream mining of regular frequent item sets.
E.R. Naganthan and F. Ramesh Dhanaseelan , 2008. Efficient Graph Structure for the Mining of Frequent Itemsets From Data Streams . International Journal of Soft Computing, 3: 144-146.