Motivation-based association rule mining

Existing algorithms for support-based association rule mining (ARM) can not discover the itemsets which are scarce but have high utility values, while utility-based association rule mining (UBARM) can not discover the itemsets whose utility values are not high but the product of the support and util...

Full description

Saved in:
Bibliographic Details
Main Authors: Xianshan Zhou, Liang Wang, Guangzhu Yu
Format: Conference Proceeding
Language:English
Subjects:
Association rules
Itemsets
Semantics
Upper bound
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Existing algorithms for support-based association rule mining (ARM) can not discover the itemsets which are scarce but have high utility values, while utility-based association rule mining (UBARM) can not discover the itemsets whose utility values are not high but the product of the support and utility of the same itemset (defined as motivation) is very large. This paper proposes motivation-based association rule and a down-top algorithm called HM-miner to discover all high motivation item-sets efficiently. By integrating the advantages of support and utility, the new measure, i.e., motivation can measure both the statistical and semantic significance of an itemset. HM-miner adopts a new pruning strategy, which is based on the motivation upper bound property, to cut down the search space.
DOI:10.1109/ICICIP.2010.5564230