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.
Chapter PDF
Similar content being viewed by others
Keywords
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
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)
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)
Dehaspe, L., Toivonen, H.: Discovery of frequent Datalog patterns. Data Mining and Knowledge Discovery 3(1), 7–36 (1999)
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)
Ferilli, S., Fanizzi, N., Mauro, N., Basile, T.: Efficient θ-subsumption under Object Identity. In: Proceedings of the ICML 2002 (2002)
Kuramochi, M., Karypsis, G.: Frequent Subgraph Discovery. In: Proceedings of the ICDM 2001, pp. 313–320 (2001)
Kuramochi, M., Karypsis, G.: An Efficient Algorithm for Discovering Frequent Subgraphs. Technical Report 02-026, University of Minesota (2002)
Nijssen, S., Kok, J.N.: Faster Association Rules for Multiple Relations. In: Proceedings of the IJCAI 2001, pp. 891–897 (2001)
Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: Proceedings of the ICDM (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nijssen, S., Kok, J.N. (2003). Efficient Frequent Query Discovery in Farmer . In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds) Knowledge Discovery in Databases: PKDD 2003. PKDD 2003. Lecture Notes in Computer Science(), vol 2838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39804-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-39804-2_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20085-7
Online ISBN: 978-3-540-39804-2
eBook Packages: Springer Book Archive