Faster Association Rules for Multiple Relations

Nijssen, Siegfried; Kok, Joost N.

Faster Association Rules for Multiple Relations

Download BibTeX Cite

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 891-895.

Abstract

Several algorithms have already been implemented which combine association rules with first order logic formulas. Although this resulted in several usable algorithms, little attention was payed until recently to the efficiency of these algorithms. In this paper we present some new ideas to turn one important intermediate step in the process of discovering such rules, i.e. the discovery of frequent item sets, more efficient. Using an implementation that we coined FARMER, we show that indeed a speed-up is obtained and that, using these ideas, the performance is much more comparable to original association rule algorithms.

Siegfried Nijssen, and Joost N. Kok. 2001. Faster Association Rules for Multiple Relations. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01. IJCAI, 891–895. https://ijcai.org/proceedings/2001/122

@inproceedings{ijcai2001p122,
  title     = {Faster Association Rules for Multiple Relations},
  author    = {Nijssen, Siegfried and Kok, Joost N.},
  booktitle = {Proceedings of the Seventeenth International Joint Conference on
               Artificial Intelligence, {IJCAI-01}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {891--895},
  year      = {2001},
  url       = {https://ijcai.org/proceedings/2001/122},
}

TY  - CPAPER
TI  - Faster Association Rules for Multiple Relations
AU  - Nijssen, Siegfried
AU  - Kok, Joost N.
T2  - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2001
SP  - 891
EP  - 895
UR  - https://ijcai.org/proceedings/2001/122
ER  -