Incremental refinement of mining queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1676, Issue , 1999, Pages 173-182

  Baralis, Elena ^a   Psaila, Giuseppe ^b  

^a POLITECNICO DI TORINO   (Italy)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA WAREHOUSES; QUERY PROCESSING;

INTERESTING INFORMATION; PROGRESSIVE REFINEMENT; RECOMPUTATION; REFINEMENT PROCESS; RULE SET;

WAREHOUSES;

EID: 84958043653     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48298-9_19     Document Type: Conference Paper

References (7)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th VLDB Conference, Santiago, Chile, 1994.
2. E. Baralis and G. Psaila. Designing templates for mining association rules. JIIS Journal of Intelligent Information Systems, 9:7-32, 1997.
3. T. Imielinski, A. Virmani, and A. Abdoulghani. Datamine: Application programming interface and query language for database mining. KDD-96, 1996.
4. W. Klementtinen, H. Mannila, P. Romkainen, H. Toivonen, and A. I. Verkamo. Finding interesting rules from large sets of discovered association rules. Third International Conference on Information and Knowledge Management, 1994.
5. R. Meo, G. Psaila, and S. Ceri. A new SQL-like operator for mining association rules. In Proceedings of the 22st VLDB Conference, Bombay, India, 1996.
6. R. Ng, L. Lackshmanan, J. Han, and A. Pang. Exploratory mining and pruning op- timizations of constrained associations rules. In Proceedings of the ACM-SIGMOD 98, Seattle, Washington, USA., June 1998.
7. G. Psaila. Integrating Data Mining Techniques and relational Databases. Ph.D. Thesis, Politecnico di Torino, 1998.