Discovery Algorithm for Mining both Direct and Indirect Weighted Association Rules

Association rules mining is one of the most important tasks in data mining research. While most of the existing discovery algorithms are focused on mining frequent itemsets, it has been noted recently that some of the infrequent itemsets can provide useful insight view into the data. As a result, indirect association rules have been put forward, the traditional association rules are called direct association rules. However, all the existing indirect association rule mining models assume that all items have the same significance without taking account of their different roles in real world applications. We put forward an indirect weighted association rule mining model to extend the indirect association rule mining model in this paper.

[1]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[2]  Qian Wan,et al.  Efficient Mining of Indirect Associations Using HI-Mine , 2003, Canadian Conference on AI.

[3]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[4]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[5]  Ada Wai-Chee Fu,et al.  Mining association rules with weighted items , 1998, Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).

[6]  Jaideep Srivastava,et al.  Indirect Association: Mining Higher Order Dependencies in Data , 2000, PKDD.