방법 비교

	Apriori 알고리즘	K-means 군집화
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1994	1967 (formalized 1982)
창시자	Agrawal, R. & Srikant, R.	MacQueen, J. B.; Lloyd, S. P.
유형	Frequent itemset and association rule mining algorithm	Partitional clustering
원전	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.	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.
별칭	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
관련	5	4
요약	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.	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.