পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| ECLAT ফ্রিকোয়েন্ট-আইটেমসেট মাইনিং× | আনুষ্ঠানিক ধারণা বিশ্লেষণ (Formal Concept Analysis - FCA)× | |
|---|---|---|
| ক্ষেত্র≠ | যন্ত্র শিখন | সফট কম্পিউটিং |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 2000 | 1982 |
| প্রবর্তক≠ | Mohammed J. Zaki | Rudolf Wille & Bernhard Ganter |
| ধরন≠ | Frequent-itemset mining algorithm (vertical format) | Lattice-based knowledge representation / concept mining |
| মৌলিক উৎস≠ | Zaki, M. J. (2000). Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3), 372–390. DOI ↗ | Wille, R. (1982). Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival (Ed.), Ordered Sets (pp. 445–470). Reidel. DOI ↗ |
| অপর নাম | Eclat algorithm, vertical association mining, tidset intersection mining, ECLAT sık örüntü madenciliği | FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi |
| সম্পর্কিত | 3 | 3 |
| সারসংক্ষেপ≠ | ECLAT, introduced by Mohammed Zaki in 2000, mines frequent itemsets using a vertical data representation: instead of scanning transactions, it stores for each item the set of transaction IDs (a tidset) that contain it, and computes the support of any itemset by intersecting tidsets. This depth-first, intersection-based approach is fast and memory-efficient, an alternative to Apriori's horizontal scans and FP-Growth's tree. | 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. |
| ScholarGateডেটাসেট ↗ |
|
|