Nooshin,
arules currently only implements mining algorithms that produce rules
with one item in the right-hand-side (RHS) (apriori, ruleInduction). If
you need rules with more than one items then you can mine frequent
itemsets (with eclat or apriori). Then you take each itemset, e.g., {1,
2, 3} and you can create the rules {1} -> {2, 3}, {2} -> {1, 3}, etc.
You can calculate the the confidence of the rules by support(itemset) /
support(lhs).
This is not very efficient since the number of possible rules to check
will be very high. That is why most algorithms only mine rules with one
item in the RHS.
Hope that helps,
Michael
--
Michael Hahsler
email: mich...@hahsler.net
web: http://michael.hahsler.net
______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.
