Association Rules

This function discovers association rules using Apriori algorithm.
Updated 22 Jul 2013

View License

Association Analysis is a method for discovering interesting relationships hidden in large datasets. Given a set of transactions, it finds rules that will predict the occurrence of an item based on the occurrences of other items in the transaction.

Rules are of the form A -> B (e.g., {onions, potatoes} - > {burger}).

The concepts of support and confidence are used to identify how strong the discovered rules are.

Support is the fraction of transactions that contain both A and B:
Support(A,B) = P(A,B)

Confidence is the fraction of transactions, where items in B appear in transactions that contain A:
Confidence(A,B) = P(B|A)

We are using Apriori algorithm to identify frequent item sets. It proceeds by identifying the frequent individual items in the database and extending them to larger item sets while the items satisfy the minimum support requirement (frequency of items in the database). The frequent item sets determined by Apriori are then used to determine association rules.

Cite As

Narine Manukyan (2024). Association Rules (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2013a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes

Added a demo file that applies the findRules method to Zachary's karate network to find missing links.