Uchimbaji wa vipengee-mara kwa mara wa ECLAT
ECLAT, iliyoanzishwa na Mohammed Zaki mwaka 2000, huchimba vipengee-mara kwa mara kwa kutumia uwakilishi wa data wima: badala ya kuchanganua miamala, huhifadhi kwa kila kipengee seti ya nambari za kitambulisho cha muamala (tidset) zinazokihusisha, na huhesabu msaada wa kipengee chochote kwa kuunganisha tidsets. Mbinu hii ya kina-kwanza, inayotegemea kuunganishwa ni ya haraka na yenye ufanisi wa kumbukumbu, mbadala wa uchanganuzi mlalo wa Apriori na mti wa FP-Growth.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Zaki, M. J. (2000). Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3), 372–390. DOI: 10.1109/69.846291 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 2). ECLAT (Equivalence Class Clustering and Bottom-up Lattice Traversal). ScholarGate. https://scholargate.app/sw/machine-learning/eclat
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Uchimbaji wa Kanuni za Chama (Apriori)Ujifunzaji wa Mashine↔ compare
- Uchanganuzi wa Dhana Rasmi (FCA)Ukokotoaji Laini↔ compare
- FP-Growth (Frequent Pattern Growth)Ujifunzaji wa Mashine↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →