Theories for mutagenicity: a study in first-order and feature-based induction
Artificial Intelligence - Special volume on empirical methods
An extended transformation approach to inductive logic programming
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Discovery of relational association rules
Relational Data Mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Induction of Logic Programs with More Than One Recursive Clause by Analyzing Saturations
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
Mining Association Rules in Multiple Relations
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
IBC: A First-Order Bayesian Classifier
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
Implementing Multi-relational Mining with Relational Database Systems
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
Multi-relational pattern mining system for general database systems
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
On enumerating frequent closed patterns with key in multi-relational data
DS'10 Proceedings of the 13th international conference on Discovery science
ILP'10 Proceedings of the 20th international conference on Inductive logic programming
Hi-index | 0.00 |
This paper proposes a mining algorithm for relational frequent patterns based on a bottom-up property extraction from examples. The extracted properties, called property items, are used to construct patterns by a level-wise way like Apriori. The property items are assumed to have a special form, which is defined in terms of mode declaration of predicates. The algorithm produces frequent itemsets as patterns without duplication in the sense of logical equivalence. It is implemented as a system called Mapixand is evaluated with four different datasets with comparison to Warmr. Mapixhad large advantage in runtime.