Fast discovery of association rules
Advances in knowledge discovery and data mining
Mining Association Rules in Multiple Relations
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
State of the art of graph-based data mining
ACM SIGKDD Explorations Newsletter
Inducing Multi-Level Association Rules from Multiple Relations
Machine Learning
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
A General Framework for Mining Frequent Subgraphs from Labeled Graphs
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
k-RNN: k-relational nearest neighbour algorithm
Proceedings of the 2008 ACM symposium on Applied computing
On Reducing Redundancy in Mining Relational Association Rules from the Semantic Web
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Compile the Hypothesis Space: Do it Once, Use it Often
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Theory and Practice of Logic Programming
Improving constrained pattern mining with first-fail-based heuristics
Data Mining and Knowledge Discovery
Fr-ONT: an algorithm for frequent concept mining with formal ontologies
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Frequent pattern discovery from OWL DLP knowledge bases
EKAW'06 Proceedings of the 15th international conference on Managing Knowledge in a World of Networks
Compile the Hypothesis Space: Do it Once, Use it Often
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
A General Framework for Mining Frequent Subgraphs from Labeled Graphs
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
AL-QuIn: An Onto-Relational Learning System for Semantic Web Mining
International Journal on Semantic Web & Information Systems
| Hi-index | 0.00 |
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.