Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| ECLAT Frekvent Postmängdsutvinning× | Formell konceptanalys (FCA)× | |
|---|---|---|
| Ämnesområde≠ | Maskininlärning | Soft computing |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 2000 | 1982 |
| Upphovsperson≠ | Mohammed J. Zaki | Rudolf Wille & Bernhard Ganter |
| Typ≠ | Frequent-itemset mining algorithm (vertical format) | Lattice-based knowledge representation / concept mining |
| Ursprungskälla≠ | 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 ↗ |
| Alias | 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 |
| Närliggande | 3 | 3 |
| Sammanfattning≠ | 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. |
| ScholarGateDatamängd ↗ |
|
|