Provides the generic function and the S4 method is.maximal for finding
maximal itemsets. Maximal frequent itemsets are used as a concise representation of frequent itemsets.
An itemset is maximal in a set if no proper superset of the
itemset is contained in the set (Zaki et al., 1997).
Maximally frequent itemsets can also be mined directly using link{apriori} or link{eclat} with target "maximally frequent itemsets".
We define here maximal rules, as the rules generated by maximal itemsets.
is.maximal(x,…)# S4 method for itemMatrix
is.maximal(x)
the set of itemsets, rules or an itemMatrix object.
further arguments.
a logical vector with the same length as x indicating
for each element in x if it is a maximal itemset.
Mohammed J. Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, and Wei Li (1997). New algorithms for fast discovery of association rules. Technical Report 651, Computer Science Department, University of Rochester, Rochester, NY 14627.