Systems and methods for maintaining closed frequent itemsets...

Details Systems and methods for maintaining closed frequent itemsets... Systems and methods for maintaining closed frequent itemsets...

2005-01-31

2009-02-24

Mofiz, Apu M (Department: 2161)

Data processing: database and file management or data structures

Database design

Data structure types

C345S660000

Reexamination Certificate

active

07496592

ABSTRACT:
Towards mining closed frequent itemsets over a sliding window using limited memory space, a synopsis data structure to monitor transactions in the sliding window so that one can output the current closed frequent itemsets at any time. Due to time and memory constraints, the synopsis data structure cannot monitor all possible itemsets, but monitoring only frequent itemsets makes it difficult to detect new itemsets when they become frequent. Herein, there is introduced a compact data structure, the closed enumeration tree (CET), to maintain a dynamically selected set of itemsets over a sliding-window. The selected itemsets include a boundary between closed frequent itemsets and the rest of the itemsets Because the boundary is relatively stable, the cost of mining closed frequent itemsets over a sliding window is dramatically reduced to that of mining transactions that can possibly cause boundary movements in the CET.

REFERENCES:
patent: 6826569 (2004-11-01), Robertson
patent: 2005/0240582 (2005-10-01), Hatonen et al.
patent: 2006/0047497 (2006-03-01), Chen et al.
Mohammed J. Zaki. et al, “Charm: An Efficient Algorithm for Closed Itemset Mining”, Computer Science Department, Ressselaer Polytechnic Institute, Troy NY, 2002, 17 pages.
Joong Hyuk Chang, et al, “Finding Recent Frequent Itemsets Adaptively over Online Data Streams”, Department of Computer Science, Yonsei University, ACM, 2003, pp. 487-492.
Wei-Guang Teng, et al, “A Regression-Based Temporal Pattern Mining Scheme for Data Streams”, Proceedings of the 29th VLDB Conference, Berlin, Germany, 2003, 12 pages.
Chang-Hung Lee, et al, “Sliding-Window Fitering: An Efficient Algorithm for Incremental Mining”, Department of Electrical Engineering, National Taiwan University, ACM, 2001, pp. 263-270.
Bayardo, Roberto J., Jr., Efficiently Mining Long Patterns from Databases, appears in Proceedings of the 1998 ACM-SIGMOD International Conference on Management of Data, 85-93.
Gouda, Karam, and Zaki, Mohammed J., Efficiently Mining Maximal Frequent Itemsets, in the Proceedings of the 2001 IEEE International Conference on Data Mining, 2001.
Wang, J., Han, J., and Pie, J., Closet+ searching for the best strategies for mining frequent closed itemsets, in proceedings of the 2003 International Conference Knowledge Discovery and Data Mining (SIGKDD'03), 2003.
Zaki, M. J., Fast Vertical Mining Using Diffsets, in proceedings of the 2003 International Conference Knowledge Discovery and Data Mining (SIGKDD'03), 2003.

Affiliated with

Also associated with

Rating

Systems and methods for maintaining closed frequent itemsets... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Systems and methods for maintaining closed frequent itemsets..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods for maintaining closed frequent itemsets... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4121839