关联规则中Apriori算法的C#实现研究

关联规则是数据挖掘中发现知识的一种有效方法，其中Apriori算法又是关联规则挖掘的经典算法。本文在分析该Apriori算法的基础上．介绍了该算法的c＃实现，包括频繁集的发现和关联规则的生成，并且通过对传统购物篮数据中的频繁集进行了验证，并且得到了其中满足最小支持度和可信度的强关联规则。

Realization of the Algorithm Apriori of Association Rules Using C#

Association rule is an effective way for knowledge discovery in data mining, wherein the algorithm Apriori is an classical algorithm.Based on the analysis of the algorithm Apriori, this paper introduces the algorithm＇s realization of discovery of frequent itemsets and generation of association rules by using C#, and at last performs a validation to discover the frequent itemsets from the traditional market- basket, and also the rules satisfying with the minimum support and confidence.