Go green: Recycle and reuse frequent patterns

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 128-139

  Cong, Gao ^a   Ooi, Beng Chin ^a   Tan, Kian Lee ^a   Tung, Anthony K H ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

FREQUENT PATTERNS; ITEMSETS; ITERATIVE MINING PROCESS; PATTERN MINING;

CONSTRAINT THEORY; DATA COMPRESSION; DATABASE SYSTEMS; ITERATIVE METHODS; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING;

DATA MINING;

EID: 2442605418     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2004.1319990     Document Type: Conference Paper

References (20)

1. http://cdiac.esd.ornl.gov/cdiac/ndps/ndp026b.html.
2. http://www.almaden.ibm.com/cs/quest/demos.html.
3. http://www.ics.uci.edu/mlearn/mlrepository.html.
4. R. Agarwal, C. Aggarwal, and V. V. V. Prasad. A tree projection algorithm for generation of frequent itemsets. In Journal of Parallel and Distributed Computing, 2000.
5. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94, pages 487-499, Santiago, Chile, Sept. 1994.
6. R. J. Bayardo. Efficiently mining long patterns from databases. In SIGMOD'98, pages 85-93, Seattle, WA, June 1998.
7. D.W. Cheung, J. Han, V. Ng, and C.Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating technique. In ICDE'96, pages 106-114, New Orleans, Louisiana, Feb. 1996.
8. G. Cong and B. Liu. Speed-up iterative frequent itemset mining with constraint changes. In ICDM'02, 2002.
9. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000.
10. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD'00, pages 1-12, Dallas, TX, May 2000.
11. J.Liu, Y. Pan, K. Wang, and J. Han. Mining frequent item sets by opportunistic projection. In SIGKDD'02, Alberta, Canada, July 2002.
12. R. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In SIGMOD'98, pages 13-24, Seattle, WA, June 1998.
13. S. Parthasarathy, M. J. Zaki, M. Ogihara, and S. Dwarkadas. Incremental and interactive sequence mining. In CIKM'99, Kansas City, MO, USA, November 1999.
14. J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent itemsets with convertible constraints. In ICDE'01, pages 433-332, Heidelberg, Germany, April 2001.
15. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang. H-mine: Hyper-structure mining of frequent patterns in large da tabases. In ICDM'01, San Jose, CA., Novermber 2001.
16. J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In DMKD'00, pages 11-20, Dallas, TX, May 2000.
17. P. Shenoy, J. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbo-charging vertical mining of large databases. In SIGMOD'00, pages 22-23, Dallas, TX, May 2000.
18. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proc. 1997 Int. Conf. Knowledge Discovery and Data Mining (KDD'97), pages 67-73, Newport Beach, CA, Aug. 1997.
19. S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka. An efficient algorithm for the incremental updation of association rules in large databases. In KDD'97, 1997.
20. Anthony K. H. Tung, G. Cong, B. Ooi, and K. Tan. Go Green: Recycle and Resuse in Human-centered, Interactive Data Mining. Techinical Report 03-2, School of Computing, NUS, 2003.