官术网_书友最值得收藏!

Overall methodology

To perform association rule mining for affinity analysis, we first use the Apriori algorithm to generate frequent itemsets. Next, we create association rules (for example, if a person recommended movie X, they would also recommend movie Y) by testing combinations of premises and conclusions within those frequent itemsets.

  1. For the first stage, the Apriori algorithm needs a value for the minimum support that an itemset needs to be considered frequent. Any itemsets with less support will not be considered.

Setting this minimum support too low will cause Apriori to test a larger number of itemsets, slowing the algorithm down. Setting it too high will result in fewer itemsets being considered frequent.

  1. In the second stage, after the frequent itemsets have been discovered, association rules are tested based on their confidence. We could choose a minimum confidence level, a number of rules to return, or simply return all of them and let the user decide what to do with them.

In this chapter, we will return only rules above a given confidence level. Therefore, we need to set our minimum confidence level. Setting this too low will result in rules that have a high support, but are not very accurate. Setting this higher will result in only more accurate rules being returned, but with fewer rules being discovered overall.

主站蜘蛛池模板: 青田县| 民权县| 东阿县| 交城县| 若尔盖县| 密山市| 夏津县| 陆良县| 陕西省| 磐安县| 盐源县| 南木林县| 马公市| 丰原市| 高尔夫| 营口市| 进贤县| 青浦区| 苏尼特左旗| 宜都市| 合川市| 共和县| 且末县| 合阳县| 小金县| 嘉禾县| 开封市| 克什克腾旗| 海兴县| 湟中县| 蓝山县| 三江| 疏附县| 龙游县| 罗甸县| 济源市| 讷河市| 家居| 渝北区| 白山市| 英山县|