Abstract: The present invention provides a system and a method for mining a new kind of association rules called disjunctive association rules, where the antecedent or the consequent of a rule may contain disjuncts of terms (X−Y or X/Y). Such rules are a natural generalization to the kind of rules that have been mined hitherto. Furthermore, disjunctive association rules are generalized in the sense that the algorithm also mines rules which have disjunctions of conjuncts (C&egr;(A.B)−(D.E)). Since the number of combinations of disjuncts is explosive, we use clustering to find a generalized subset. The said clustering is preferably performed using agglomerative clustering methods for finding the greedy subset.