Advertisement

Efficient Frequent Query Discovery in Farmer

  • Siegfried Nijssen
  • Joost N. Kok
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2838)

Abstract

The upgrade of frequent item set mining to a setup with multiple relations – frequent query mining – poses many efficiency problems. Taking Object Identity as starting point, we present several optimization techniques for frequent query mining algorithms. The resulting algorithm has a better performance than a previous ILP algorithm and competes with more specialized graph mining algorithms in performance.

Keywords

Pattern Mining Object Identity Query Expansion Query Evaluation Inductive Logic Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Agrawal, R., Manilla, H., Srikant, R., Toivonen, H., Verkamo, A.: Fast Discovery of Association Rules. In: Fayyad, U.M., et al. (eds.) Advances in Knowledge Discovery and Datamining, pp. 307–328. AAAI/MIT Press (1996)Google Scholar
  2. 2.
    Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., Vandecasteele, H.: Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs. Journal of Artificial Intelligence Research 16, 135–166 (2002)zbMATHGoogle Scholar
  3. 3.
    Dehaspe, L., Toivonen, H.: Discovery of frequent Datalog patterns. Data Mining and Knowledge Discovery 3(1), 7–36 (1999)CrossRefGoogle Scholar
  4. 4.
    Esposito, F., Laterza, A., Malerba, D., Semeraro, G.: Refinement of Datalog Programs. In: Proceedings of the MLnet Familiarization Workshop on Data Mining with Inductive Logic Programming, pp. 73–94 (1996)Google Scholar
  5. 5.
    Ferilli, S., Fanizzi, N., Mauro, N., Basile, T.: Efficient θ-subsumption under Object Identity. In: Proceedings of the ICML 2002 (2002)Google Scholar
  6. 6.
    Kuramochi, M., Karypsis, G.: Frequent Subgraph Discovery. In: Proceedings of the ICDM 2001, pp. 313–320 (2001)Google Scholar
  7. 7.
    Kuramochi, M., Karypsis, G.: An Efficient Algorithm for Discovering Frequent Subgraphs. Technical Report 02-026, University of Minesota (2002)Google Scholar
  8. 8.
    Nijssen, S., Kok, J.N.: Faster Association Rules for Multiple Relations. In: Proceedings of the IJCAI 2001, pp. 891–897 (2001)Google Scholar
  9. 9.
  10. 10.
    Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: Proceedings of the ICDM (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Siegfried Nijssen
    • 1
  • Joost N. Kok
    • 1
  1. 1.Leiden Institute of Advanced Computer ScienceLeidenThe Netherlands

Personalised recommendations