Provides the generic function is.maximal()
and methods 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).
is.maximal(x, ...)# S4 method for itemMatrix
is.maximal(x)
# S4 method for itemsets
is.maximal(x)
# S4 method for rules
is.maximal(x)
a logical vector with the same length as x
indicating for
each element in x
if it is a maximal itemset.
the set of itemsets, rules or an itemMatrix object.
further arguments.
Michael Hahsler
Maximally frequent itemsets can also be mined directly using
apriori()
or eclat()
with target "maximally frequent
itemsets".
We define here maximal rules, as the rules generated by maximal itemsets.
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.
Other postprocessing:
is.closed()
,
is.generator()
,
is.redundant()
,
is.significant()
,
is.superset()
Other associations functions:
abbreviate()
,
associations-class
,
c()
,
duplicated()
,
extract
,
inspect()
,
is.closed()
,
is.generator()
,
is.redundant()
,
is.significant()
,
is.superset()
,
itemsets-class
,
match()
,
rules-class
,
sample()
,
sets
,
size()
,
sort()
,
unique()