Machine learningMachine learning
Semi-supervised Apriori Algorithm
The Semi-supervised Apriori algorithm extends the classic Apriori frequent-itemset miner by injecting background knowledge or labeled constraints — such as must-link pairs, forbidden items, or user-specified minimum support thresholds per group — to bias discovery toward practically meaningful association rules and reduce the search space.
Open in MethodMindSoonVideoSoon
Read the full method
Members only
Sign inSign in with a free account to read this section.
Sources
- Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 487–499. link ↗
- Liu, B., Hsu, W., & Ma, Y. (1999). Mining association rules with multiple minimum supports. Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 337–341. DOI: 10.1145/312129.312274 ↗