搜索资源列表
my_apriori
- 该程序使用matlab，实现了经典的Apriori 算法，挖掘频繁项集。-The program uses matlab, realizing the classic Apriori algorithm for mining frequent item sets.
Apriori
- 用Apriori算法进行频繁项挖掘,输入文件格式参见input中的例子。-Mining frequent item with Apriori algorithm, the input file format see input examples.
fp_growth
- 数据挖掘的FPgrowth算法，快速的获得频繁项集-FPgrowth data mining algorithms, fast access to frequent item sets
Apriori
- 数据挖掘中的经典算法apriori。输入项集和最小支持度，输出频繁项集。-Data Mining the classical algorithm apriori. Entry and set minimum support, output frequent item sets.
APriori
- 用于生成频繁项集，后续关联算法，希望能对大家有所帮助-Used to generate frequent item sets, the subsequent correlation algorithm, we hope to help
itemcf
- Hadoop平台上的物品协同过滤程序，使用Java语言编写(A Item Collaborate Filter Program based on Hadoop platform written by Java)
SVD.m
- 利用SVD实现item-based CF: 优点： 简化数据，去除噪声，提高算法的结果 缺点： 数据的转换可能难以理解 适用数据类型： 数值型数据(Svd decomposition plays an important role in the decomposition of eigenvalues of high-dimensional data, while using low-dimensional data for approximate approximation)
退火算法
- 利用退火算法解决最优化问题，如最多带物品的质量为M，每件物品的质量为mi，价格为yi，怎么做才能带走价值最多的物品？(Annealing algorithm to solve the optimization problem, such as the maximum quality of goods with M, the quality of each item is Mi, the price is Yi, how to do to take away the most valuable i