Advertisement

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

  • Jean-François Boulicaut
  • Mika Klemettinen
  • Heikki Mannila
Communications Session 7. Sequential and Spatial Data Mining
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1510)

Abstract

Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pattern, zooming on a subset of the data, and postprocessing some patterns. We describe a comprehensive framework in which all these steps can be carried out by means of queries over an inductive database. An inductive database is a database that in addition to data also contains intensionally defined generalizations about the data. We formalize this concept: an inductive database consists of a normal database together with a subset of patterns from a class of patterns, and an evaluation function that tells how the patterns occur in the data. Then, looking for potential query languages built on top of SQL, we consider the research on the MINE RULE operator by Meo, Psaila and Ceri. It is a serious step towards an implementation framework for inductive databases, though it addresses only the association rule mining problem. Perspectives are then discussed.

References

  1. 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.Google Scholar
  2. 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.Google Scholar
  3. 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.Google Scholar
  4. 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.Google Scholar
  5. 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.Google Scholar
  6. 6.
    U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors. Advances in Knowledge Discovery and Data Mining. AAAI Press, 1996.Google Scholar
  7. 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/tvdbuss, 1998.Google Scholar
  8. 8.
    J. M. Hellerstein. Optimization techniques for queries with expensive methods. ACM Transaction on Database Systems, 1998. To appear.Google Scholar
  9. 9.
    T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58–64, Nov. 1996.CrossRefGoogle Scholar
  10. 10.
    G. Lausen and G. Vossen. Models and Languages of Object-Oriented Databases. Addison-Wesley Publishing Company, 1997.Google Scholar
  11. 11.
    H. Mannila. Inductive databases and condensed representations for data mining. In ILPS’97, pages 21–30. MIT Press, 1997.Google Scholar
  12. 12.
    H. Mannila. Methods and problems in data mining. In ICDT’97, volume 1186 of LNCS, pages 41–55, Springer-Verlag, 1997.Google Scholar
  13. 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.CrossRefGoogle Scholar
  14. 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.Google Scholar
  15. 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.Google Scholar
  16. 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.Google Scholar
  17. 17.
    H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hätönen, and H. Mannila. Pruning and grouping of discovered association rules. In Workshop Notes of the ECML-95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases, pages 47–52. MLnet, 1995.Google Scholar
  18. 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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Jean-François Boulicaut
    • 1
  • Mika Klemettinen
    • 1
  • Heikki Mannila
    • 1
  1. 1.Department of Computer ScienceUniversity of HelsinkiFinland

Personalised recommendations