Association rules mining with relative weighted support

  • Authors:
  • Zailani Abdullah;Mustafa Mat Deris

  • Affiliations:
  • Universiti Malaysia Terengganu, Terengganu, Malaysia;Universiti Tun Hussein Onn Malaysia, Batu Pahat, Johor, Malaysia

  • Venue:
  • Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mining weighted association rules are very important in a domain of knowledge discovery. Most of traditional association rules are focused on binary relationships rather than the mixture binary-weight relationships of items. As a result, the significance of weight of each item in a transaction is just ignored completely. Until this instance, only few studies are dedicated for weighted schemes as compared to existing binary association rules. Here, we propose a novel weighted association rules scheme called Relative Weighted Support (RWS). The result reveals that RWS can easily discover the significance of weighted association rules and surprisingly all of them are extracted from the least items.