Feng Tao
Fionn Murtagh
ABSTRACT
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to handle weighted association rule mining problems where each item is allowed to have a weight. The goal is to steer the mining focus to those significant relationships involving items with significant weights rather than being flooded in the combinatornal explosion of insignificant relationships. We identify the challenge of using weights in the iterative process of generating large itemsets. The problem of invalidation of the "downward closure property" in the weighted setting is solved by using an improved model of weighted support measurements and exploiting a "weighted downward closure property". A new algorithm called WARM (Weighted Association Rule Mining) is developed based on the improved model. The algorithm is both scalable and efficient in discovering significant relationships in weighted settings as illustrated by experiments performed on simulated datasets.
- R. Agrawal et al, "The Quest Data Mining System" Technical report, IBM Almaden Research Center, http://www.almaden.ibm.com/cs/quest/, 1996.Google Scholar
- R. Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large databases", Proc. of the 1993 ACM SIGMOD Int'l Conf. on Management of Data, Washington, DC, 1993, pp. 207. Google ScholarDigital Library
- R. Agrawal and R. Srikant, "Fast algorithms for mining association rules in large databases", Proc. of the 20th Inte'l Conf. on Very Large Data Bases (VLDB'94), Santiago, Chile, 1994, pp. 487--499. Google ScholarDigital Library
- Fernando Berzal, Juan C. Cubero, Nicolas Marin, José-Maria Serrano, "TBAR: An efficient method for association rule mining in relational databases," Data & Knowledge Engineering, Vol. 37, No. 1, 2001, pp. 47--64. Google ScholarDigital Library
- Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur, "Dynamic itemset counting and implication rules for market basket data", Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, Tucson, AZ, USA, 1997. Google ScholarDigital Library
- Toon Calders and Bart Goethals, "Mining All Non-Derivable Frequent Itemsets", Proc. of the 6th European Conf. on Principles of Data Mining and Knowledge Discovery, 2002, pp. 74--85. Google ScholarDigital Library
- Jiawei Han and Yongjian Fu, "Discovery of Multiple-Level Association Rules from Large Databases" in the Proceedings of the 1995 Int'l Conf. on Very Large Data Bases (VLDB'95), Zurich, Switzerland, 2002, pp. 420--431. Google ScholarDigital Library
- Bing Liu, Wynne Hsu, and Yiming Ma, "Mining Association Rules with Multiple Supports", Proc. of the ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (KDD-99), SanDiego, CA, USA, 1999. Google ScholarDigital Library
- N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Efficient mining of association rules using closed itemset lattices," Information Systems, Vol. 24, No. 1, 1999, pp. 25--46. Google ScholarDigital Library
- G. D. Ramkumar, Sanjay Ranka, and Shalom Tsur, "Weighted Association Rules: Model and Algorithm" KDD1998, 1998.Google Scholar
- Feng Tao, "Mining Binary Relationships from Transaction Data in Weighted Settings" PhD Thesis, School of Computer Science, Queen's University Belfast, UK, 2003.Google Scholar
- W. Wang, J. Yang and P. Yu "Efficient mining of weighted association rules (WAR)", Proc. of the ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, 270--274, 2000. Google ScholarDigital Library
Index Terms
- Weighted Association Rule Mining using weighted support and significance framework
Recommendations
Fuzzy Weighted Association Rule Mining with Weighted Support and Confidence Framework
New Frontiers in Applied Data MiningIn this paper we extend the problem of mining weighted association rules. A classical model of boolean and fuzzy quantitative association rule mining is adopted to address the issue of invalidation of downward closure property (DCP) in weighted ...
Valency based weighted association rule mining
PAKDD'10: Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part IAssociation rule mining is an important data mining task that discovers relationships among items in a transaction database. Most approaches to association rule mining assume that all items within a dataset have a uniform distribution with respect to ...
Approximate weighted frequent pattern mining with/without noisy environments
In data mining area, weighted frequent pattern mining has been suggested to find important frequent patterns by considering the weights of patterns. More extensions with weight constraints have been proposed such as mining weighted association rules, ...
Comments