搜索资源列表
Maxfpminer1
- 本程序实现通过构造一棵前缀树实现 最大模式频繁项集挖掘算法.应用fp树增长算法实现.-the program by constructing a prefix tree to achieve the greatest model Frequent Mining algorithms. Application fp growth tree algorithm.
bomo
- 关联规则的频繁项集算法bomo的源代码，含说明文件，C编写，可在linux和windows下编译。-Related and regular frequent source codes which collects algorithm bomo, includes the supporting paper, C is written, can compile under linux and windows
fpmax_star
- 关联规则中的频繁项集生成算法fomax*，一个非常优秀的算法，由中国人（朱建飞）的参与。-association rules of frequent item sets Algorithm trillion *, a very good algorithm, China (Zhu Jianfei) participation.
Mafia-1.4
- 关联规则中的频繁项集生成算法Mafia1.4版本，一个效果非常好的算法，可在linux和windows下编译运行。-association rules of frequent item sets Algorithm Mafia1.4 version, a very good effect algorithm, and the Linux compiler running under windows.
Maxfpminer1
- 本程序实现通过构造一棵前缀树实现 最大模式频繁项集挖掘算法.应用fp树增长算法实现.-the program by constructing a prefix tree to achieve the greatest model Frequent Mining algorithms. Application fp growth tree algorithm.
bomo
- 关联规则的频繁项集算法bomo的源代码，含说明文件，C编写，可在linux和windows下编译。-Related and regular frequent source codes which collects algorithm bomo, includes the supporting paper, C is written, can compile under linux and windows
fpmax_star
- 关联规则中的频繁项集生成算法fomax*，一个非常优秀的算法，由中国人（朱建飞）的参与。-association rules of frequent item sets Algorithm trillion*, a very good algorithm, China (Zhu Jianfei) participation.
TreeMiner
- 关联规则中的频繁项集生成算法TreeMiner，可在linux和windows下编译运行。-Frequent one of related rule collect and produce algorithm TreeMiner , can compile running under linux and windows
fimi141
- 频繁模式挖掘算法，可以用于数据挖掘中关联规则的频繁项集挖掘- The frequent pattern excavation algorithm, may use in the data mining to be connected the rule the frequent item of collection to excavate
555555555555555555555
- 关联规则挖掘发现大量数据中项集之间有趣的关联或相关联系，管理员要通过啊，我很努力的找的啊-Mining Association Rules found a large quantity of data between Itemsets interesting correlation or relevance, administrators should ah, I worked hard to find the ah
apriori(C++)
- 本算法的基本功能是用C＋＋语言实现了APRIORI算法，用户可以先选择要进行的操作。然后再输入支持度和置信度，就可得到挖掘的结果。 输出的结果主要包括两个部分。 1．输出所有的频繁项集。 2．输出所有的产生的规则。 算法还能够输出初始的事务集合，并且可以输出产生的中间结果。-the algorithm is the basic functions using C++ language of APRIORI algorit
apriori_improve
- 数据挖掘中频繁项集挖掘算法，改进了apriori算法，性能提高很多-Data Mining frequent itemsets mining algorithm, improved apriori algorithm, improve the performance of many
apriori(java)
- Apriori算法是发现关联规则领域的经典算法。该算法将发现关联规则的过程分为两个步骤：第一步通过迭代，检索出事务数据库中的所有频繁项集，即支持度不低于用户设定的阈值的项集；第二步利用频繁项集构造出满足用户最小信任度的规则-Apriori association rules algorithm is found in the field of classical algorithms. The algorithm will find t
apriori
- apriori算法的java代码，APRRORI算法使用频繁项性质的先验知识，逐层搜索迭代，用K-项集产生(K+1)-项集。APRRORI算法的一个显著特点是:利用APRIORI性质，压缩了频繁项集，提高了算法的效率。 -apriori algorithm java code, APRRORI algorithm uses the a priori nature of frequent itemsets knowledge, ste
Apriori
- 数据挖掘，找强关联规则。我和同学一起合作的，我负责频繁项集，强关联规则的稍后上传。-Data mining, finding strong association rules. I and students work together, and I am responsible for frequent itemsets and strong association rules later upload.
cheswithdiffrentsurpport
- 模式识别领域的通用数据集，在不同的支持度下的频繁项集。-The field of pattern recognition of common data sets, at different levels of support under the frequent itemsets.
data_mining
- 数据挖掘，从大量的数据中按属性分类，通过寻找频繁子集，最终找到最优频繁项集-Data mining, data from a large number of categories according to property, often by finding a subset of frequent itemsets eventually find the optimal
FP树关联规则挖掘频繁项集
- 根据用户的轨迹寻找用户的最频繁项集，找到用户经常出现的区域(According to the user's trajectory to find the user's most frequent itemsets, to find frequent users of the region)
Apriori
- 数据挖掘，频繁项集和关联规则,C++源代码模拟程序(Data mining, frequent itemsets and association rules, C++ source code simulation program)
FP-TREE
- 在Eclipse平台上用java语言实现了Fp——Tree频繁模式的挖掘，并且能够成功运行。(On the Eclipse platform using Java language to achieve the Fp - Tree frequent pattern mining, and can successfully run.)