مقایسهٔ روش‌ها

	تحلیل مفهوم صوری (FCA)	کاوش قوانین انجمنی (آپریوری)	خوشه‌بندی سلسله‌مراتبی
حوزه	محاسبات نرم	یادگیری ماشین	یادگیری ماشین
خانواده	Machine learning	Machine learning	Machine learning
سال پیدایش	1982	1994	1963
پدیدآور	Rudolf Wille & Bernhard Ganter	Rakesh Agrawal & Ramakrishnan Srikant	Ward, J. H.
نوع	Lattice-based knowledge representation / concept mining	Unsupervised pattern discovery algorithm	Unsupervised clustering (agglomerative)
منبع بنیادین	Wille, R. (1982). Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival (Ed.), Ordered Sets (pp. 445–470). Reidel.	Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.
نام‌های دیگر	FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi	Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
مرتبط	3	3	4
خلاصه	Formal concept analysis derives a hierarchy of concepts from a simple table of which objects have which attributes. Founded by Rudolf Wille in 1982 on lattice theory, it pairs each set of objects with the attributes they all share to form 'formal concepts', then organizes these into a concept lattice — a mathematically grounded, interpretable hierarchy used for knowledge discovery, ontology building, and explainable analysis of categorical data.	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.	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.