ScholarGate
Assistent
Machine learningPattern mining

Association Rule Mining (Apriori)

Association Rule Mining er en uovervåget datamining-teknik, der afdækker mønstre for samtidig forekomst blandt elementer i transaktionsdatasæt. Formelt introduceret af Agrawal, Imieliński og Swami i 1993 og forfinet med den banebrydende Apriori-algoritme af Agrawal og Srikant i 1994, identificerer den regler af formen X ⇒ Y – hvilket betyder, at transaktioner, der indeholder elementmængden X, også har tendens til at indeholde elementmængden Y – kvantificeret ved support, confidence og lift.

Åbn i MethodMindSnartVideoSnartDownload slides

Læs hele metoden

Kun for medlemmer

Log ind med en gratis konto for at læse dette afsnit.

Log ind

Method map

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

Kilder

  1. Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216. DOI: 10.1145/170035.170072
  2. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th VLDB Conference, 487–499. link

Sådan citerer du denne side

ScholarGate. (2026, June 2). Association Rule Mining (Apriori). ScholarGate. https://scholargate.app/da/machine-learning/association-rule-mining

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

Refereret af

ScholarGateAssociation Rule Mining (Association Rule Mining (Apriori)). Hentet 2026-06-15 fra https://scholargate.app/da/machine-learning/association-rule-mining · Datasæt: https://doi.org/10.5281/zenodo.20539026