ScholarGate
Msaidizi
Machine learningPattern mining

FP-Growth (Frequent Pattern Growth)

FP-Growth, iliyoanzishwa na Jiawei Han, Jian Pei, na Yiwen Yin mwaka 2000, huchimba seti za bidhaa zinazojitokeza kutoka kwa data ya miamala bila kutengeneza seti za wagombea, hatua ya gharama ambayo hupunguza kasi ya algoriti ya kawaida ya Apriori. Inabanana hifadhidata kuwa mti wa ruwaza unaojitokeza (FP-tree) kwa skani mbili, kisha hukuza ruwaza zinazojitokeza kwa kurudia kutoka kwa muundo huo, na kuifanya kuwa ya haraka zaidi kuliko Apriori kwenye seti kubwa za data zenye msongamano.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

The neighbourhood of related methods — select a node to explore.

+8 more

Vyanzo

  1. Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI: 10.1145/342009.335372
  2. Han, J., Pei, J., Yin, Y., & Mao, R. (2004). Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1), 53–87. DOI: 10.1023/B:DAMI.0000005258.31418.83

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 2). FP-Growth (Frequent Pattern Growth). ScholarGate. https://scholargate.app/sw/machine-learning/fp-growth

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.

Compare side by side

Imerejelewa na

ScholarGateFP-Growth (FP-Growth (Frequent Pattern Growth)). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/machine-learning/fp-growth · Seti ya data: https://doi.org/10.5281/zenodo.20539026