- Learning Data Mining with Python(Second Edition)
- Robert Layton
- 220字
- 2021-07-02 23:40:11
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.
- 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.
- 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.
- TypeScript Blueprints
- 騰訊iOS測試實踐
- Photoshop智能手機APP UI設計之道
- Learning Linux Binary Analysis
- R語言數據可視化實戰
- INSTANT Sencha Touch
- Python王者歸來
- Learning Neo4j 3.x(Second Edition)
- Python機器學習:手把手教你掌握150個精彩案例(微課視頻版)
- Cocos2d-x學習筆記:完全掌握Lua API與游戲項目開發 (未來書庫)
- C語言程序設計上機指導與習題解答(第2版)
- Go語言開發實戰(慕課版)
- 高性能MVVM框架的設計與實現:San
- Game Development Patterns and Best Practices
- C語言從入門到精通(微視頻精編版)