{
  "id": "apriori-algorithm-059107-0fca6ec3ea5465ca",
  "slug": "apriori-algorithm",
  "title": "Apriori algorithm",
  "qid": "Q513511",
  "lead": "Apriori is an algorithm for frequent item set mining and association rule learning over relational databases. It proceeds by identifying the frequent individual items in the database and extending them to larger and larger item sets as long as those item sets appear sufficiently often in the database. The frequent item sets determined by Apriori can be used to determine association rules which highlight general trends in the database: this has applications in domains such as market basket analysis.",
  "body": "Apriori is an algorithm for frequent item set mining and association rule learning over relational databases. It proceeds by identifying the frequent individual items in the database and extending them to larger and larger item sets as long as those item sets appear sufficiently often in the database. The frequent item sets determined by Apriori can be used to determine association rules which highlight general trends in the database: this has applications in domains such as market basket analysis. if u ∈ L for all u ⊆ c where |u| = k-1 result.add(c) return result ==External links== ARtool, GPL Java association rule mining application with GUI, offering implementations of multiple algorithms for discovery of frequent patterns and extraction of association rules (includes Apriori) SPMF offers Java open-source implementations of Apriori and several variations such as AprioriClose, UApriori, AprioriInverse, AprioriRare, MSApriori, AprioriTID, and other more efficient algorithms such as FPGrowth and LCM. Christian Borgelt provides C implementations for Apriori and many other frequent pattern mining algorithms (Eclat, FPGrowth, etc.). The code is distributed as free software under the MIT license. The R package arules contains Apriori and Eclat and infrastructure for representing, manipulating and analyzing transaction data and patterns. Efficient-Apriori is a Python package with an implementation of the algorithm as presented in the original paper.",
  "categories": [
    "23118434",
    "23302980",
    "23603337",
    "72915207"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1318539200",
  "content_hash": "0fca6ec3ea5465ca0b757ea87effd6a2c65b384d5b723d9a8722a57485a881e1",
  "created_at": 1792308745.9388225,
  "updated_at": 1761306415.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "apriori-algorithm-059107-0fca6ec3ea5465ca",
    "type": "webpage",
    "title": "Apriori algorithm",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/apriori-algorithm",
    "issued": {
      "date-parts": [
        [
          2026,
          10,
          18
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:apriori-algorithm-059107-0fca6ec3ea5465ca",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1318539200",
    "note": "Immutable snapshot apriori-algorithm-059107-0fca6ec3ea5465ca, content root 0fca6ec3ea5465ca…"
  }
}