本帖最后由 sinner 于 2013-2-14 09:17 编辑
R Reference Card for Data Mining
Association Rules & Frequent Itemsets
APRIORI Algorithm
a level-wise, breadth-first algorithm which counts transactions to find frequent
itemsets
apriori() mine associations with APRIORI algorithm (arules)
ECLAT Algorithm
employs equivalence classes, depth-first search and set intersection instead of
counting
eclat() mine frequent itemsets with the Eclat algorithm (arules)
下载
R-refcard-data-mining.rar
(134.8 KB, 下载次数: 0, 售价: 2 )
备注:
很多人都有收集一堆资料而不看的习惯。为了有效利用资源,养成下载一本看一本的习惯,特设置了积分下载,请见谅。
多参加论坛的活动、多帮助别人,会很容易凑够积分的!
祝大家使用愉快!
|