Efficient frequent query discovery in FARMER

(2003) The 7th European Conference on Principles and Practice of Knowledge Discovery in Databases — Location: Cavtat, Croatia

Files

pkdd2003.pdf
  • Open Access
  • Adobe PDF
  • 169.49 KB

Details

Authors
Abstract
(en) 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.
Affiliations

Citations

Nijssen, S., & Kok, J. (2003). Efficient frequent query discovery in FARMER. Knowledge Discovery in Databases: PKDD 2003, p. 350-362. https://doi.org/10.1007/978-3-540-39804-2_32