Querying inductive databases: A case study on the MINE RULE operator

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

Volumn 1510, Issue , 1998, Pages 194-202

  Boulicaut, Jean François ^a   Klemettinen, Mika ^a   Mannila, Heikki ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES; QUERY PROCESSING;

DATA SET; DATA TRANSFORMATION; EVALUATION FUNCTION; INDUCTIVE DATABASE; KNOWLEDGE DISCOVERY IN DATABASE; MINE RULES; POST PROCESSING; RULE MINING;

DATA MINING;

EID: 84947721195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0094820     Document Type: Conference Paper

References (18)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In SIGMOD'93, pages 207-216. ACM, 1993.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, 1996.
3. J.-F. Boulicaut, M. Klemettinen, and H. Mannila. Modeling KDD processes within the inductive database framework. Technical Report C-1998-29, Department of Computer Science, P.O. Box 26, FIN-00014 University of Helsinki, Finland, June 1998. Submitted.
4. L. Dehaspe and L. D. Raedt. Mining association rules in multiple relations. In ILP'97, volume 1297 of LNAI, pages 125-132. Springer-Verlag, 1997.
5. L. Dehaspe and H. Toivonen. Frequent query discovery: a unifying ILP approach to association rule mining. Technical Report CW-258, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, March 1998.
6. U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors. Advances in Knowledge Discovery and Data Mining. AAAI Press, 1996.
7. B. Goethals, J. V. den Bussche, and K. Vanhoof. Decision support queries for the interpretation of data mining results. Manuscript, University of Limburg (Belgium), available at http://www.luc.ac.be/~vdbuss, 1998.
8. J. M. Hellerstein. Optimization techniques for queries with expensive methods. ACM Transaction on Database Systems, 1998. To appear.
9. T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications o] the ACM, 39(11):58 64, Nov. 1996.
10. G. Lausen and G. Vossen. Models and Languages of Object-Oriented Databases. Addison-Wesley Publishing Company, 1997.
11. H. Mannila. Inductive databases and condensed representations for data mining. In ILPS'97, pages 21-30. MIT Press, 1997.
12. H. Mannila. Methods and problems in data mining. In ICDT'97, volume 1186 of LNCS, pages 41-55. Springer-Verlag, 1997.
13. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
14. R. Meo, G. Psaila, and S. Ceri. A new SQL-like operator for mining association rules. In VLDB'96, pages 122-133. Morgan Kaufmann, 1996.
15. R. Meo, G. Psaila, and S. Ceri. A tightly-coupled architecture for data mining. In ICDE'98, pages 316-322. IEEE Computer Society Press, 1998.
16. R. Ng, L. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In SIGMOD'98, pages 13-24. ACM, 1998.
17. H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hätönen, and H. Mannila. Pruning and grouping of discovered association rules. In Workshop Notes o] the ECML-95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases, pages 47 52. MLnet, 1995.
18. D. Tsur, J. D. Ullman, S. Abiteboul, C. Clifton, R. Motwani, S. Nestorov, and A. Rozenthal. Query flocks: A generalization of association-rule mining. In SIGMOD' 98, pages 1-12. ACM, 1998.