中文说明:这是一个解决经典的关联规则挖掘问题中的Aprior算法,通过该算法可以得到非常详细的k(k>=1)频繁项集!
English Description:
This is a solution to the classic Aprior Association rules mining algorithm by the algorithm can get very detailed k (k>=1) frequent item sets!Aprior algorithms, data mining, association rules
关注次数: 251
下载次数: 0
文件大小: 1.99 kB
中文说明:这是一个解决经典的关联规则挖掘问题中的Aprior算法,通过该算法可以得到非常详细的k(k>=1)频繁项集!
English Description:
This is a solution to the classic Aprior Association rules mining algorithm by the algorithm can get very detailed k (k>=1) frequent item sets!