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

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.

主站蜘蛛池模板: 呼和浩特市| 长阳| 淮滨县| 南郑县| 宁南县| 武汉市| 寿阳县| 苗栗市| 大英县| 新乐市| 云南省| 蓬莱市| 阳泉市| 青川县| 临夏市| 长垣县| 开鲁县| 望城县| 盐山县| 鹤壁市| 兰州市| 即墨市| 尼木县| 敦化市| 达州市| 宜兰市| 海城市| 醴陵市| 宜城市| 梧州市| 双柏县| 布拖县| 亚东县| 北碚区| 阳山县| 济宁市| 松江区| 廊坊市| 新河县| 绍兴市| 盘山县|