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

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.

主站蜘蛛池模板: 陆川县| 沁源县| 新竹市| 韩城市| 开远市| 潍坊市| 新巴尔虎右旗| 嘉荫县| 玛纳斯县| 武强县| 广昌县| 汕头市| 稻城县| 南投县| 安义县| 大港区| 阜宁县| 奉节县| 安泽县| 虞城县| 乃东县| 高雄县| 科技| 香河县| 阜新| 林周县| 海南省| 华容县| 靖安县| 湖口县| 霸州市| 阿拉尔市| 尼勒克县| 大理市| 亚东县| 泸水县| 南澳县| 长丰县| 铁力市| 大理市| 延川县|