방법 비교

	연관 규칙 마이닝(Apriori)	입자 컴퓨팅 (정보 입자화)	계층적 군집화
분야	머신러닝	소프트 컴퓨팅	머신러닝
계열	Machine learning	Machine learning	Machine learning
기원 연도	1994	1997	1963
창시자	Rakesh Agrawal & Ramakrishnan Srikant	Lotfi A. Zadeh (information granulation); developed by Pedrycz, Skowron, Yao	Ward, J. H.
유형	Unsupervised pattern discovery algorithm	Framework for multi-granularity information processing	Unsupervised clustering (agglomerative)
원전	Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216.	Zadeh, L. A. (1997). Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets and Systems, 90(2), 111–127.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.
별칭	Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis	information granulation, computing with granules, three-way granular computing, tanecikli hesaplama	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
관련	3	3	4
요약	Association Rule Mining is an unsupervised data-mining technique that discovers co-occurrence patterns among items in transactional datasets. Formally introduced by Agrawal, Imieliński, and Swami in 1993, and refined with the landmark Apriori algorithm by Agrawal and Srikant in 1994, it identifies rules of the form X ⇒ Y — meaning that transactions containing itemset X tend to also contain itemset Y — quantified by support, confidence, and lift.	Granular computing is a problem-solving paradigm that processes information in 'granules' — clumps of objects drawn together by indistinguishability, similarity, or functionality — rather than at the level of individual data points. Articulated by Lotfi Zadeh in 1997 as fuzzy information granulation and developed into a broad framework, it provides a unifying umbrella over fuzzy sets, rough sets, and interval methods, letting analysis move to whichever level of detail a problem actually requires.	Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.