Optimization of a language for data mining

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2003, Pages 437-444

  Meo, Rosa ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

Association rules; Constraints; Query optimization

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; CONSTRAINT THEORY; OPTIMIZATION; PROGRAM COMPILERS; QUERY LANGUAGES;

QUERY OPTIMIZATION;

DATA MINING;

EID: 0038336924     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/952532.952619     Document Type: Conference Paper

References (16)

1. E. Baralis and G. Psaila. Incremental refinement of mining queries. In Proc. of the 1st Int'l Conf. on Data Warehousing and Knowledge Discovery, pages 173-182, Firenze, Italy, 1999.
2. M. Botta, R. Meo, and M.L. Sapino. Incremental execution of the mine rule operator. Technical Report RT 66/2002, Dipartimento di Informatica, Università di Torino, Italy, May 2002.
3. V. Ng D. Cheung, J. Han and C.Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating technique. In Proc. of 1996 Int'l Conf. on Data Engineering, New Orleans, Louisiana, USA, February 1996.
4. B. Goethals and J. Van den Bussche. A priori versus a posteriori filtering of association rules. In Proc. of SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 1999.
5. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58-64, November 1996.
6. B. Jeudy and J-F. Boulicaut. Constraint-based discovery and inductive queries: application to association rule mining. In Proc. of the Science Foundation Exploratory Workshop on Pattern Detection and Discovery in Data Mining, Imperial College, London, September 2002.
7. B. Jeudy and J-F. Boulicaut. Optimization of association rule mining queries. Intelligent Data Analysis journal, 6(5):195-224, 2002.
8. B. Jeudy and J-F. Boulicaut. Using condensed representations for interactive association rule mining. In Proc. of the 6th European Conf. on Principles and Practice of Knowledge Discovery in Databases, Helsinki, Finland, 2002.
9. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, November 1997.
10. R. Meo, G. Psaila, and S. Ceri. A new sql-like operator for mining association rules. In Proc. of the 22nd VLDB Conference, Bombay, India, Sept. 1996.
11. R. Meo, G. Psaila, and S. Ceri. An extension of SQL for mining association rules. Data Mining and Knowledge Discovery, 2(2):195-224, 1998.
12. R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained association rules. In Proc. ACM SIGMOD'98, pages 13-24, Seattle, WA, 1998.
13. R. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang. Optimization of constrained frequent set queries with 2-variable constraints. In Proc. ACM SIGMOD'99, pages 157-168, Philadelphia, PA, 1998.
14. J. Pei and J. Han. Can we push more constraints into frequent pattern mining? In Proc. of the Int'l Conf. on KDD, Boston, MA, August 2000.
15. J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent itemsets with convertible constraints. In Proc. 2001 Int'l Conf. on Data Engineering, Heidelberg, Germany, April 2001.
16. J. Wijsen and R. Meersman. On the complexity of mining quantitative association rules. Data Mining and Knowledge Discovery, 2(3):263-281, 1998.