Machine learningMachine learning

Algoritms Ensemble Apriori

Algoritms Ensemble Apriori piemēro ansambļa principus klasiskajam biežo kopu ieguves algoritmam Apriori, palaižot vairākas Apriori instances uz dažādām datu partīcijām vai ar dažādiem parametru iestatījumiem un apvienojot to noteikumu kopas. Šī pieeja uzlabo segumu, samazina jutīgumu pret minimālā atbalsta sliekšņa vērtību un ļauj asociācijas noteikumu ieguvei mērogoties uz lielākiem transakciju datu kopumiem.

Atvērt MethodMindDrīzumāVideoDrīzumāDownload slides

Lasīt pilno metodes aprakstu

Tikai dalībniekiem

Piesakieties ar bezmaksas kontu, lai lasītu šo sadaļu.

Pieteikties

Method map

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

Avoti

  1. Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 1215, 487–499. link
  2. Apriori algorithm. Wikipedia. link

Kā citēt šo lapu

ScholarGate. (2026, June 3). Ensemble Apriori Algorithm (Ensemble-Based Frequent Pattern and Association Rule Mining). ScholarGate. https://scholargate.app/lv/machine-learning/ensemble-apriori-algorithm

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
ScholarGateEnsemble Apriori Algorithm (Ensemble Apriori Algorithm (Ensemble-Based Frequent Pattern and Association Rule Mining)). Izgūts 2026-06-15 no https://scholargate.app/lv/machine-learning/ensemble-apriori-algorithm · Datu kopa: https://doi.org/10.5281/zenodo.20539026