방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 연관 규칙× | K-means 군집화× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1993 | 1967 (formalized 1982) |
| 창시자≠ | Agrawal, R., Imielinski, T., & Swami, A. | MacQueen, J. B.; Lloyd, S. P. |
| 유형≠ | Unsupervised pattern discovery | Partitional clustering |
| 원전≠ | 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 ↗ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ |
| 별칭 | market basket analysis, association rule mining, frequent itemset mining, affinity analysis | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means |
| 관련 | 4 | 4 |
| 요약≠ | 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. | K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis. |
| ScholarGate데이터셋 ↗ |
|
|