This is Homework 1 from the course "資料探勘與社群網路分析DATA MINING & SOCIAL NETWORK ANALYSIS" in NCKU.
To understand what this algorithm is for and what kind of problems it can potentially solve, we'll need to first understand the following theorem.
- Conditional Probability
- Strong Association Rule
- We represent the strong association rule as "{ Item A } -> { Item B, Item C }"
- To declare this statement, we'll need to first satisfy the two sub-rules.
- Minimum Support:
- Minimum Confidence: