Scribd
Upload
51 views1 page

Apriori Is A Classic Algorithm Used in Data Mining and Association Rule Learning

The Apriori algorithm is a classic data mining algorithm used to discover frequent itemsets and association rules. It operates on a transactional database to identify sets of items that occur together frequently. The algorithm uses an iterative approach, starting with frequent individual items and generating longer candidate itemsets, pruning those that are infrequent. This process continues until no more frequent itemsets are found, from which association rules are derived. Support and confidence measures evaluate the quality of association rules discovered.

Uploaded by

Aljhon Banderada
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views1 page

Apriori Is A Classic Algorithm Used in Data Mining and Association Rule Learning

The Apriori algorithm is a classic data mining algorithm used to discover frequent itemsets and association rules. It operates on a transactional database to identify sets of items that occur together frequently. The algorithm uses an iterative approach, starting with frequent individual items and generating longer candidate itemsets, pruning those that are infrequent. This process continues until no more frequent itemsets are found, from which association rules are derived. Support and confidence measures evaluate the quality of association rules discovered.

Uploaded by

Aljhon Banderada
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Apriori is a classic algorithm used in data mining and association rule learning.

It is named after
the Latin phrase "a priori," which means "from the earlier" or "from the former." The Apriori
algorithm is primarily used to discover frequent itemsets in a transactional dataset and generate
association rules based on those itemsets.

The algorithm operates on a transactional database, which consists of a set of transactions. Each
transaction represents a collection of items. The goal of the Apriori algorithm is to identify all
frequent itemsets, which are sets of items that occur together in a significant number of
transactions. These frequent itemsets can then be used to derive association rules, which express
relationships between different items.

The Apriori algorithm uses an iterative approach to discover frequent itemsets. It starts by
finding all frequent individual items, known as 1-itemsets. It then generates candidate itemsets
of size k+1 based on the frequent k-itemsets found in the previous iteration. The algorithm
prunes the candidate itemsets by applying the "apriori property," which states that if an itemset
is infrequent, then all its supersets will also be infrequent. This pruning step helps reduce the
search space and improves the efficiency of the algorithm.

The process continues iteratively until no more frequent itemsets can be found. Once all
frequent itemsets are discovered, association rules can be generated from them. An association
rule consists of an antecedent (premise) and a consequent (conclusion), both of which are
itemsets. The support and confidence measures are used to evaluate the quality of association
rules.

Support represents the fraction of transactions that contain a particular itemset, and confidence
measures how often the consequent appears in transactions that contain the antecedent. By
setting minimum thresholds for support and confidence, the Apriori algorithm can filter out less
significant associations and focus on the more interesting and meaningful ones.

The Apriori algorithm is widely used in market basket analysis, where it helps identify items
that are frequently purchased together. It has also found applications in other areas such as web
mining, bioinformatics, and recommendation systems.

You might also like