방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 연관 규칙× | Apriori 알고리즘× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1993 | 1994 |
| 창시자≠ | Agrawal, R., Imielinski, T., & Swami, A. | Agrawal, R. & Srikant, R. |
| 유형≠ | Unsupervised pattern discovery | Frequent itemset and association rule mining algorithm |
| 원전≠ | Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216. DOI ↗ | 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 ↗ |
| 별칭 | market basket analysis, association rule mining, frequent itemset mining, affinity analysis | Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining |
| 관련≠ | 4 | 5 |
| 요약≠ | Association rule learning is an unsupervised technique that discovers co-occurrence patterns — 'if X then Y' implications — within large transactional datasets. Originally formalized by Agrawal, Imielinski, and Swami (1993) for supermarket basket analysis, it is now widely applied in e-commerce recommendation, health informatics, bioinformatics, and behavioral research. | The Apriori algorithm, introduced by Agrawal and Srikant in 1994, is the foundational method for discovering frequent itemsets and association rules in transactional databases. It uses a breadth-first, level-wise search guided by the anti-monotone property of support to efficiently enumerate all item combinations that co-occur above a user-set minimum threshold, then extracts interpretable if-then rules from those patterns. |
| ScholarGate데이터셋 ↗ |
|
|