Mining generalised disjunctive association rules

摘要: This paper introduces generalised disjunctive association rules such as "People who buy bread also butter jam", and either raincoats or umbrellas flashlights". A rule allows the disjunction of conjuncts, jackets bow ties neckties tiepins". Such capture contextual inter-relationships among items.Given a context (antecedent), there may be large number that satisfy minsupp minconf constraints. It is computationally expensive to find all rules. We present algorithm thrifty traverse which borrows concepts subsumption from propositional logic mine subset in feasible way. experimented with our on US census data well transaction grocery superstore demonstrate its computational feasibility, utility scalability.