Relational association mining based on structural analysis of saturation clauses

Authors:
Nobuhiro Inuzuka;Jun-ichi Motoyama;Tomofumi Nakano
Affiliations:
Nagoya Institute of Technology, Nagoya, Japan;Nagoya Institute of Technology, Nagoya, Japan;Nagoya Institute of Technology, Nagoya, Japan
Venue:
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Year:
2006

Citing 7
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Three companions for data mining in first order logic

Relational Data Mining
Discovery of relational association rules

Relational Data Mining
Relational Association Rules: Getting WARMeR

Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
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
Inductive inference of VL decision rules

ACM SIGART Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

Restricting the form of rules is an important issue of relational association rule mining. The proposing method PIX extracts properties from given examples and to use them to form rules. An property of an instance consists of an addressing part which specifies objects related to the instance and description part which says something among the objects. Extracted properties are used like as an item in market basket database and an APRIORI-like algorithm calculates frequent item sets. The paper describes also an experiment in a sample application.