21-05-2014, 12:47 PM
Mining association rules between sets of items in large databases
ABSTRACT
In this paper the problem of mining association rules was introduced. An association rule is an expression X => Y, where X and Y are the sets of items. The intuitive meaning of such a rule is that transactions of the database which contain X tend to contain Y. An example of such a rule might be that of 98% of customers that purchase tires and automobile accessories also has automotive services carried out. The research of Assocition Rule mining was further extended by R Agarwal to discover an algorithm known as Apriori for mining frequent itemsets.