手法を比較

	形式概念分析 (FCA)	関連ルールマイニング（Apriori）	粒計算（情報粒化）
分野	ソフトコンピューティング	機械学習	ソフトコンピューティング
系統	Machine learning	Machine learning	Machine learning
提唱年	1982	1994	1997
提唱者	Rudolf Wille & Bernhard Ganter	Rakesh Agrawal & Ramakrishnan Srikant	Lotfi A. Zadeh (information granulation); developed by Pedrycz, Skowron, Yao
種類	Lattice-based knowledge representation / concept mining	Unsupervised pattern discovery algorithm	Framework for multi-granularity information processing
原典	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.	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.
別名	FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi	Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis	information granulation, computing with granules, three-way granular computing, tanecikli hesaplama
関連	3	3	3
概要	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.	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.